The incompleteness of set theory ZF C leads one to look for natural nonconservative extensions of ZF C in which one can prove statements independent of ZF C which appear to be “true”. One approach has been to add large cardinal axioms.Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski-Grothendieck set theory T G or It is a nonconservative extension of ZF C and is obtained from other axiomatic set theories by the inclusion of Tarski’s axiom (...) which implies the existence of inaccessible cardinals. See also related set theory with a filter quantifier ZF (aa). In this paper we look at a set theory NC# ∞# , based on bivalent gyper infinitary logic with restricted Modus Ponens Rule In this paper we deal with set theory NC# ∞# based on bivalent gyper infinitary logic with Restricted Modus Ponens Rule. Nonconservative extensions of the canonical internal set theories IST and HST are proposed. (shrink)

The incompleteness of set theory ZFC leads one to look for natural extensions of ZFC in which one can prove statements independent of ZFC which appear to be "true". One approach has been to add large cardinal axioms. Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski- Grothendieck set theory TG [1]-[3] It is a non-conservative extension of ZFC and is obtaineed from other axiomatic set theories by the inclusion of Tarski's axiom which implies the existence (...) of inaccessible cardinals [1].Non-conservative extension of ZFC based on an generalized quantifiers considered in [4]. In this paper we look at a set theory NC_{∞^{#}}^{#},based on bivalent gyper infinitary logic with restricted Modus Ponens Rule [5]-[8]. In this paper we deal with set theory NC_{∞^{#}}^{#} based on gyper infinitary logic with Restricted Modus Ponens Rule. Set theory NC_{∞^{}}^{} contains Aczel's anti-foundation axiom [9]. We present a new approach to the invariant subspace problem for Hilbert spaces. Our main result will be that: if T is a bounded linear operator on an infinite-dimensional complex separable Hilbert space H,it follow that T has a non-trivial closed invariant subspace. Non-conservative extension based on set theory NC_{∞}^{#} of the model theoretical nonstandard analysis [10]-[12] also is considered. (shrink)

In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. External induction principle in nonstandard intuitionistic arithmetic were derived. Non trivial application in number theory is considered.

Our main goal is to investigate whether the infinitary rules for the quantifiers endorsed by Elia Zardini in a recent paper are plausible. First, we will argue that they are problematic in several ways, especially due to their infinitary features. Secondly, we will show that even if these worries are somehow dealt with, there is another serious issue with them. They produce a truth-theoretic paradox that does not involve the structural rules of contraction.

A focussed issue of The Reasoner on the topic of 'Infinitary Reasoning'. Owen Griffiths and A.C. Paseau were the guest editors.

Main results are: (i) number e^{e} is transcendental; (ii) the both numbers e+π and e-π are irrational.

The infinitary function of the truth predicate consists in its ability to express infinite conjunctions and disjunctions. A transparency principle for truth states the equivalence between a sentence and its truth predication; it requires an introduction principle—which allows the inference from “snow is white” to “the sentence ‘snow is white’ is true”—and an elimination principle—which allows the inference from “the sentence ‘snow is white’ is true” to “snow is white”. It is commonly assumed that a theory of truth needs (...) to satisfy a transparency principle to fulfil the infinitary function. Picollo and Schindler (Erkenntnis 83:899–928, 2017) argue against this idea. They prove that, given certain assumptions, an elimination principle is sufficient for the purpose. Then, they pose a challenge: to show why we should incorporate introduction principles to our theory of truth. In this essay I take on the challenge. I show that, given the authors’ assumptions, an introduction principle is also sufficient to perform the infinitary function. (shrink)

Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the strategy used by Peirce to defend logical principles can be used to defend bivalence. Construing logic as the study of substitutions of equivalent representations, Peirce showed that some patterns of substitution get realized in the very act of questioning them. While I recognize that we can devise non-classical notations, (...) I argue that, when we make claims about those notations, we inevitably get saddled with bivalent commitments. I present several simple inferences to show this. The argument that results from those examples is ‘pragmatic’, because the inevitability of the principle is revealed in use (not mention); and it is ‘semiotic’, because this revelation happens in the use of signs. (shrink)

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and structured (...) objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)

A brief article introducing *One True Logic*. The book argues that there is one correct foundational logic and that it is highly infinitary.

I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is (...) countably infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory. -/- Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects. (shrink)

My paper examines the problem of evil in its logical form, and along lines of African philosophizing. I construe the problematic nature of this problem [of evil] (hereafter, λ) as arising from a Western logical structure, which takes the valuation of propositions as being marked by a rigid bivalence of only truth (T) and falsity (F). By this structure, values and propositions are diametrically pitted against each other such that it appears that choice is only restrained to an ‘either’, ‘or’. (...) My argument transcends and dismantles this bivalence and subscribes to the African system of Ezumezu logic, developed by Jonathan Okeke Chimakonam which permits the pursuit of a trivalent logical course of ‘either’, ‘or’, in addition to ‘and’. Employing the logical system of Ezumezu, I demonstrate a negative resolution to λ, showing via the ‘principle of value-complementarity’, that good and evil as observed and experienced, are not opposites, but rather complements. The conclusions I draw from my analysis bear some implication for the conception of the Supreme Being; for one, I argue that conceiving the Supreme Being in African philosophy through the categories of the superlative ‘omni’ properties is mistaken , and also, I argue that this Supreme Being is better conceived as a harmony of good and evil: an embodiment of balance. (shrink)

This short article discusses the fact that the word ‘ancestor’ features in certain arguments that a) are apparently logically valid, b) contain infinitely many premises, and c) are such that none of their finite sub-arguments are logically valid. The article's aim is to motivate, within its brief compass, the study of infinitary logics.

In this fragment of Opuscula Logica it is displayed an arithmetical treatment of the aristotelic syllogisms upon the previous interpretations of Christine Ladd-Franklin and Jean Piaget. For the first time, the whole deductive corpus for each syllogism is presented in the two innovative modalities first proposed by Hugo Padilla Chacón. A. The Projection method (all the possible expressions that can be deduced through the conditional from a logical expression) and B. The Retrojection method (all the possible valid antecedents or premises (...) conjunction for an expression proposed as a conclusion). The results are numerically expressed, with their equivalents in the propositional language of bivalent logic. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in Sections (...) 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

Roman Suszko said that “Obviously, any multiplication of logical values is a mad idea and, in fact, Łukasiewicz did not actualize it.” The aim of the present paper is to qualify this ‘obvious’ statement through a number of logical and philosophical writings by Professor Jan Woleński, all focusing on the nature of truth-values and their multiple uses in philosophy. It results in a reconstruction of such an abstract object, doing justice to what Suszko held a ‘mad’ project within a generalized (...) logic of judgments. Four main issues raised by Woleński will be considered to test the insightfulness of such generalized truth-values, namely: the principle of bivalence, the logic of scepticism, the coherence theory of truth, and nothingness. (shrink)

Note: The author holds the copyright, and there was no agreement, express or implied, not to use a facsimile PDF. -/- Using erotetic logic, the paper defines the "the whole truth" in a manner consistent with U.S. Supreme Court precedent. It cannot mean "the whole story," as witnesses in an adversary system are permitted /only/ to answer the questions put to them, nor are they permitted to speculate, add irrelevant material, etc. Nor can it mean not to add an (...) admixture of falsity, as that is already included in "nothing but the truth," and, strictly speaking, in "the truth," as any such as admixture renders the whole thing false (given bivalence is presupposed) by &-introduction. (shrink)

Here are considered the conditions under which the method of diagrams is liable to include non-classical logics, among which the spatial representation of non-bivalent negation. This will be done with two intended purposes, namely: a review of the main concepts involved in the definition of logical negation; an explanation of the epistemological obstacles against the introduction of non-classical negations within diagrammatic logic.

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once (...) the right set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

This article tries to present a possible way of proliferating bivalent, trivalent, etc. calculation. Beyond the controversies as to the effects that involve the presence versus the absence of the temporal factor, no significant attempts of adapting a bivalent logic to other pairs of values have been mentioned. Should the transformation of the alethiologic modalities into logic values be possible, five more bivalent calculations may be added to the classic bivalent calculation. All these new (...) calculations are compatible with the traditional one, to the extent that they submit to the conditions of non-contradictoriness and exhaustibility, and the connectors receive, even if partially, the corresponding value interpretations. (shrink)

This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not (...) want to equate falsity with the non-existence of a proof since this would render a statement such as “pi is transcendental” false prior to 1882. In addition, the intuitionist account of negation as shorthand for the derivation of absurdity is inadequate, particularly outside of purely mathematical contexts. To deal with these issues, I investigate the dual of intuitionistic logic, co-intuitionistic logic, as a logic of refutation, alongside intuitionistic logic of proofs. Direct proof and refutation are dual to each other, and are constructive, whilst there also exist syntactic, weak, negations within both logics. In this respect, the logic of refutation is weakly paraconsistent in the sense that it allows for statements for which, neither they, nor their negation, are refuted. I provide a proof theory for the co-constructive logic, a formal dualizing map between the logics, and a Kripke-style semantics. This is given an intuitive philosophical rendering in a re-interpretation of Kolmogorov’s logic of problems. (shrink)

ABSTRACT: This chapter offers a revenge-free solution to the liar paradox (at the centre of which is the notion of Gestalt shift) and presents a formal representation of truth in, or for, a natural language like English, which proposes to show both why -- and how -- truth is coherent and how it appears to be incoherent, while preserving classical logic and most principles that some philosophers have taken to be central to the concept of truth and our use (...) of that notion. The chapter argues that, by using a truth operator rather than truth predicate, it is possible to provide a coherent, model-theoretic representation of truth with various desirable features. After investigating what features of liar sentences are responsible for their paradoxicality, the chapter identifies the logic as the normal modal logic KT4M (= S4M). Drawing on the structure of KT4M (=S4M), the author proposes that, pace deflationism, truth has content, that the content of truth is bivalence, and that the notions of both truth and bivalence are semideterminable. (shrink)

Standard responses to the question of the nature of logic can be broadly classified into two, namely: logical monists that privilege traditional logic above non-traditional logic and logical pluralists who recognize the legitimacy of many-valued logic and use same to argue for some form of logical relativity. The line of distinction appears to be fairly clear as traditional, Aristotelian, two-valued and standard logic maintains fidelity with the principle of bivalence and the traditional laws of thought (...) while non-traditional, non-Aristotelian, many-valued, non-standard or alternative logics somehow break their fidelity to the principle of bivalence and the traditional laws of thought. It appears to be settled that relativity typically belongs only to non-traditional logics. Contrary to this understanding, this paper argued that some level of relativity Is presupposed in traditional logic by the legitimacy enjoyed by syllogistic, propositional and predicate logics as a body of systems that make up traditional logic. This paper called for the revision of monistic approaches to traditional logic. Since there is some measure of relativity among traditional systems of logic, de-emphasizing the differences among syllogistic, propositional and predicate logics while stressing their unity as 'traditional logic' leads to the fallacy of accent. This fallacy occurs when theorists place vocal emphasis on the unity among traditional logical systems while ignoring their differences. (shrink)

How to say no less, no more about conditional than what is needed? From a logical analysis of necessary and sufficient conditions (Section 1), we argue that a stronger account of conditional can be obtained in two steps: firstly, by reminding its historical roots inside modal logic and set-theory (Section 2); secondly, by revising the meaning of logical values, thereby getting rid of the paradoxes of material implication whilst showing the bivalent roots of conditional as a speech-act based (...) on affirmations and rejections (Section 3). Finally, the two main inference rules for conditional, viz. Modus Ponens and Modus Tollens, are reassessed through a broader definition of logical consequence that encompasses both a normal relation of truth propagation and a weaker relation of falsity non-propagation from premises to conclusion (Section 3). (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system (...) which consists of linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, (...) the categoricity problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach (...) can be naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, (...) the categoricity problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

In his book The Boundary Stones of Thought, Ian Rumfitt considers five arguments in favour of intuitionistic logic over classical logic. Two of these arguments are based on reflections concerning the meaning of statements in general, due to Michael Dummett and John McDowell. The remaining three are more specific, concerning statements about the infinite and the infinitesimal, statements involving vague terms, and statements about sets.Rumfitt is sympathetic to the premisses of many of these arguments, and takes some of (...) them to be effective challenges to Bivalence, the following principle: Each statement is either true or false.However, he argues that counterexamples to Bivalence do not immediately lead to counterexamples to Excluded Middle, and so do not immediately refute classical logic; here, Excluded Middle is taken to be the following principle: For each statement A, is true.Much... (shrink)

This chapter discusses the defence of metaphysical indeterminacy by Elizabeth Barnes and Robert Williams and discusses a classical and bivalent theory of such indeterminacy. Even if metaphysical indeterminacy arguably is intelligible, Barnes and Williams argue in favour of it being so and this faces important problems. As for classical logic and bivalence, the chapter problematizes what exactly is at issue in this debate. Can reality not be adequately described using different languages, some classical and some not? Moreover, it (...) is argued that the classical and bivalent theory of Barnes and Williams does not avoid the problems that arise for rival theories. (shrink)

The present contribution might be regarded as a kind of defense of the common sense in logic. It is demonstrated that if the classical negation is interpreted as the minimal negation with n = 2 truth values, then deviant logics can be conceived as extension of the classical bivalent frame. Such classical apprehension of negation is possible in non- classical logics as well, if truth value is internalized and bivalence is replaced by bipartition.

Is logic empirical? Is logic to be found in the world? Or is logic rather a convention, a product of conventions, part of the many rules that regulate the language game? Answers fall in either camp. We like the linguistic answer. In this paper, we want to analyze how a linguistic community would tackle the problem of developing a logic and show how the linguistic conventions adopted by the community determine the properties of the local (...) class='Hi'>logic. Then show how to move from a notion of logic that varies from community to community to a notion of logic that is in a sense universal. The framework is conventional up to a point: we have sentences, atomic and composite, the connectives are interpreted, values are computed, and the value of a composite sentence is a function of the values of its subsentences. Less conventional is the use of a plurality of truth values, and the sharp distinction we draw between sentences and statements, in the spirit of the distinction between proposition and judgment that one may find in proof theory. The linguistic community will face many choices. What are the good ones, the ones to avoid? Are there, in some sense, optimal choices? These are the kind of issues we are addressing. Where do we end up? With some kind of universal bivalent logic, ironically enough. We start from an arbitrarily large number of truth values, atomic sentences and connectives, construct a generic many-valued logic, recover more or less the usual results and issues, and in the end it all comes down to a positive bivalent logic with two connectives, `and' and `or', as if logic is nothing more than a mere accounting of possibilities. (shrink)

This paper deals with the problem of future contingents, and focuses on two classical logical principles, excluded middle and bivalence. One may think that different attitudes are to be adopted towards these two principles in order to solve the problem. According to what seems to be a widely held hypothesis, excluded middle must be accepted while bivalence must be rejected. The paper goes against that line of thought. In the first place, it shows how the rejection of bivalence leads to (...) implausible consequences if excluded middle is accepted. In the second place, it addresses the question of why one should reject bivalence, and finds no satisfactory answer. /// Este artículo trata el problema de los futuros contingentes, y se enfoca en dos principios lógicos clásicos: el tercero excluido y la bivalencia. Se podría pensar que una solución del problema requiere actitudes diferentes hacia estos dos principios. Según una hipótesis que parece ampliamente compartida, el tercero excluido debe ser aceptado, mientras que la bivalencia debe ser rechazada. Este artículo argumenta en contra de esta línea de pensamiento. En primer lugar, se aborda cómo el rechazo de la bivalencia lleva a consecuencias poco plausibles si el tercero excluido es aceptado. En segundo lugar, se enfrenta la cuestión de por qué se debería rechazar la bivalencia, sin encontrar una respuesta satisfactoria. (shrink)

It is a widely held principle that no one is able to do something that would require the past to have been different from how it actually is. This principle of the fixity of the past has been presented in numerous ways, playing a crucial role in arguments for logical and theological fatalism, and for the incompatibility of causal determinism and the ability to do otherwise. I will argue that, assuming bivalence, this principle is in conflict with standard views about (...) knowledge and the semantics for ‘actually’. I also consider many possible responses to the argument. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with (...) common knowledge. Also, we show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

The main thesis of this work is as follows: there are versions of Yablo’s paradox that, if Cook is right about the non-circular character of his version of it, are truly paradoxical and genuinely non-circular, and Cook’s version of Yablo’s paradox is one of them. Here I will not evaluate the"circular" or"non-circular" side to Cook’s proposal. In fact, I think that he is right about it, and that his version of Yablo’s list is non-circular. But is it paradoxical? In order (...) to be so, the principles that lead to (i) the derivation of a contradiction, or (ii) the impossibility to give a stable assignment of truth values to the relevant set of sentences, must be acceptable. I will explore two ways to argue that they are not. I will conclude that these attempts lead to a very narrow conception of a theory of truth, or to deny that a paradigmatic case of paradox, such as the"Old-Fashioned Liar," is truly paradoxical. La tesis principal de este trabajo es la siguiente: hay versiones de la paradoja de Yablo tales que, si Cook está en lo cierto acerca del carácter no-circular de su propia versión de ella, son genuinamente paradójicas y auténticamente no-circulares, y la versión de Cook en cuestión es una de ellas. Aquí no voy a evaluar su carácter circular o no-circular. Creo, de hecho, que Cook está en lo correcto sobre el punto. Pero, ¿es su versión auténticamente paradójica? Para que lo fuera, los principios que llevan a (i) derivar una contradicción, o (ii) la imposibilidad de dar una asignación de valores de verdad estables al conjunto relevante de oraciones, deben ser aceptables. Voy a explorar dos modos de argumentar que no lo son. voy a concluir que estos intentos llevan a una concepción de la teoría de la verdad muy estrecha, o a negar que un caso paradigmático de paradoja, como el"mentiroso Tradicional", sea auténticamente paradójica. (shrink)

In De interpretatione 9, Aristotle argues against the fatalist view that if statements about future contingent singular events (e.g. ‘There will be a sea battle tomorrow,’ ‘There will not be a sea battle tomorrow’) are already true or false, then the events to which those statements refer will necessarily occur or necessarily not occur. Scholars have generally held that, to refute this argument, Aristotle allows that future contingent statements are exempt from either the principle of bivalence, or the law of (...) excluded middle. This paper offers a new interpretation of Aristotle’s refutation of fatalism. According to this interpretation, each member of a pair of contradictory future contingent statements, in virtue of expressing modal necessity, is simply false. (shrink)

In this paper we critically review Correia’s and Rosenkranz’s Nothing to Come. A Defence of the Growing Block Theory of Time, published by Springer in 2018. By taking into account the essential reliance of the book on tense logic, we bring out the existence of a conflict between their logical axioms, that presuppose truth bivalence even for statements concerning future contingents, and the principle of groundedness that they also advocate. According to this principle, a proposition Q is now groundedly (...) true as long as sometimes in the future it will be the case that there exists something that makes Q true. However, if the events that occur in 2060 do not exist unrestrictedly (for us, here in 2021), what, in reality, can possibly ground the truth (or falsity) of Q? In the second part of the paper, we concentrate on some conceptual difficulties raised by their brilliant attempt to adapt the growing block view of reality to a relativistic setting, based on what they call bow-tie presentism, according to which for each spacetime point s only s plus the spacelike-related region with respect to s exists. By extending temporal logic into a relativity-friendly spatiotemporal logic, we conclude by noting that Correia and Rosenkranz’s Nothing to Come makes very important strides in showing that there are technical ways to develop the growing block of reality into an ontology that coheres with relativity theories perfectly well, while retaining most of the distinctive content of classical growing block theory. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the resulting (...) logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, we (...) notice that cut remains eliminable when suitable arithmetical axioms are added to the system. Finally, we establish a direct link between cut-free derivability in infinitary formulations of the systems considered and fixed-point semantics. Noticeably, unlike what happens with other background logics, such links are established without imposing any restriction to the premisses of the truth rules. (shrink)

The purpose of this paper is to challenge some widespread assumptions about the role of the modal axiom 4 in a theory of vagueness. In the context of vagueness, axiom 4 usually appears as the principle ‘If it is clear (determinate, definite) that A, then it is clear (determinate, definite) that it is clear (determinate, definite) that A’, or, more formally, CA → CCA. We show how in the debate over axiom 4 two different notions of clarity are in play (...) (Williamson-style "luminosity" or self-revealing clarity and concealeable clarity) and what their respective functions are in accounts of higher-order vagueness. On this basis, we argue first that, contrary to common opinion, higher-order vagueness and S4 are perfectly compatible. This is in response to claims like that by Williamson that, if vagueness is defined with the help of a clarity operator that obeys axiom 4, higher-order vagueness disappears. Second, we argue that, contrary to common opinion, (i) bivalence-preservers (e.g. epistemicists) can without contradiction condone axiom 4 (by adopting what elsewhere we call columnar higher-order vagueness), and (ii) bivalence-discarders (e.g. open-texture theorists, supervaluationists) can without contradiction reject axiom 4. Third, we rebut a number of arguments that have been produced by opponents of axiom 4, in particular those by Williamson. (The paper is pitched towards graduate students with basic knowledge of modal logic.). (shrink)

What the world needs now is another theory of vagueness. Not because the old theories are useless. Quite the contrary, the old theories provide many of the materials we need to construct the truest theory of vagueness ever seen. The theory shall be similar in motivation to supervaluationism, but more akin to many-valued theories in conceptualisation. What I take from the many-valued theories is the idea that some sentences can be truer than others. But I say very different things to (...) the ordering over sentences this relation generates. I say it is not a linear ordering, so it cannot be represented by the real numbers. I also argue that since there is higher-order vagueness, any mapping between sentences and mathematical objects is bound to be inappropriate. This is no cause for regret; we can say all we want to say by using the comparative truer than without mapping it onto some mathematical objects. From supervaluationism I take the idea that we can keep classical logic without keeping the familiar bivalent semantics for classical logic. But my preservation of classical logic is more comprehensive than is normally permitted by supervaluationism, for I preserve classical inference rules as well as classical sequents. And I do this without relying on the concept of acceptable precisifications as an unexplained explainer. The world does not need another guide to varieties of theories of vagueness, especially since Timothy Williamson (1994) and Rosanna Keefe (2000) have already provided quite good guides. I assume throughout familiarity with popular theories of vagueness. (shrink)

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules (...) for the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

Proceeding on the Automatic Deduction System developped at the Philosophy Faculty of the UNAM at Mexico City. (Deduktor Mexican Group of Logics work under the direction of the professor Hugo Padilla Chacón). Conference presented at the mexican City of Guadalajara at the Universidad de Guadalajara, Jalisco, by invitation of the latinoamerican association of philosophy SOPHIA. Early stage of the deductional systems at 2-valued logic. This work embodies the implementation of the first whole and standalone arithmetization of bivalent (...) class='Hi'>Logic, the theoretical framework of Hugo Padilla Chacón published in 1984. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

Lee Archie argued that if any truth-values are consistently assigned to a natural language conditional, where modus ponens and modus tollens are valid argument forms, and affirming the consequent is invalid, this conditional will have the same truth-conditions as a material implication. This argument is simple and requires few and relatively uncontroversial assumptions. We show that it is possible to extend Archie’s argument to three- and five-valued logics and vindicate a slightly weaker conclusion, but one that is still important: Even (...) if you do not believe in bivalence and the classical negation operator, you would still have good reasons to accept that natural language conditionals and the material implication share truth-conditions. (shrink)

Various philosophers have long since been attracted to the doctrine that future contingent propositions systematically fail to be true—what is sometimes called the doctrine of the open future. However, open futurists have always struggled to articulate how their view interacts with standard principles of classical logic—most notably, with the Law of Excluded Middle. For consider the following two claims: Trump will be impeached tomorrow; Trump will not be impeached tomorrow. According to the kind of open futurist at issue, both (...) of these claims may well fail to be true. According to many, however, the disjunction of these claims can be represented as p ∨ ~p—that is, as an instance of LEM. In this essay, however, I wish to defend the view that the disjunction these claims cannot be represented as an instance of p ∨ ~p. And this is for the following reason: the latter claim is not, in fact, the strict negation of the former. More particularly, there is an important semantic distinction between the strict negation of the first claim [~] and the latter claim. However, the viability of this approach has been denied by Thomason, and more recently by MacFarlane and Cariani and Santorio, the latter of whom call the denial of the given semantic distinction “scopelessness”. According to these authors, that is, will is “scopeless” with respect to negation; whereas there is perhaps a syntactic distinction between ‘~Will p’ and ‘Will ~p’, there is no corresponding semantic distinction. And if this is so, the approach in question fails. In this paper, then, I criticize the claim that will is “scopeless” with respect to negation. I argue that will is a so-called “neg-raising” predicate—and that, in this light, we can see that the requisite scope distinctions aren’t missing, but are simply being masked. The result: a under-appreciated solution to the problem of future contingents that sees and as contraries, not contradictories. (shrink)

Todd (2016) proposes an analysis of future-directed sentences, in particular sentences of the form 'will(φ)', that is based on the classic Russellian analysis of definite descriptions. Todd's analysis is supposed to vindicate the claim that the future is metaphysically open while retaining a simple Ockhamist semantics of future contingents and the principles of classical logic, i.e. bivalence and the law of excluded middle. Consequently, an open futurist can straightforwardly retain classical logic without appeal to supervaluations, determinacy operators, or (...) any further controversial semantical or metaphysical complication. In this paper, we will show that this quasi-Russellian analysis of 'will' both lacks linguistic motivation and faces a variety of significant problems. In particular, we show that the standard arguments for Russell's treatment of definite descriptions fail to apply to statements of the form 'will(φ)'. (shrink)

One well known approach to the soritical paradoxes is epistemicism, the view that propositions involving vague notions have definite truth values, though it is impossible in principle to know what they are. Recently, Paul Horwich has extended this approach to the liar paradox, arguing that the liar proposition has a truth value, though it is impossible to know which one it is. The main virtue of the epistemicist approach is that it need not reject classical logic, and in particular (...) the unrestricted acceptance of the principle of bivalence and law of excluded middle. Regardless of its success in solving the soritical paradoxes, the epistemicist approach faces a number of independent objections when it is applied to the liar paradox. I argue that the approach does not offer a satisfying, stable response to the paradoxes—not in general, and not for a minimalist about truth like Horwich. (shrink)

Suszko’s Thesis is a philosophical claim regarding the nature of many-valuedness. It was formulated by the Polish logician Roman Suszko during the middle 70s and states the existence of “only but two truth values”. The thesis is a reaction against the notion of many-valuedness conceived by Jan Łukasiewicz. Reputed as one of the modern founders of many-valued logics, Łukasiewicz considered a third undeter- mined value in addition to the traditional Fregean values of Truth and Falsehood. For Łukasiewicz, his third value (...) could be seen as a step beyond the Aristotelian dichotomy of Being and non-Being. According to Suszko, Łukasiewicz’s ideas rested on a confusion between algebraic values (what sentences describe/denote) and log- ical values (truth and falsity). Thus, Łukasiewicz’s third undetermined value is no more than an algebraic value, a possible denotation for a sentence, but not a genuine logical value. Suszko’s Thesis is endorsed by a formal result baptized as Suszko’s Reduction, a theorem that states every Tarskian logic may be characterized by a two-valued semantics. The present study is intended as a thorough investigation of Suszko’s thesis and its implications. The first part is devoted to the historical roots of many-valuedness and introduce Suszko’s main motivations in formulating the double character of truth-values by drawing the distinction in between algebraic and logical values. The second part explores Suszko’s Reduction and presents the developments achieved from it; the properties of two-valued semantics in comparison to many-valued semantics are also explored and discussed. Last but not least, the third part investigates the notion of logical values in the context of non-Tarskian notions of entailment; the meaning of Suszko’s thesis within such frameworks is also discussed. Moreover, the philosophical foundations for non-Tarskian notions of entailment are explored in the light of recent debates concerning logical pluralism. (shrink)