In this paper we consider the logics L(i,n) obtained from the (n+1)-valued Lukasiewicz logics L(n+1) by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L(i,n) is maximal w.r.t. CPL whenever n is prime. Concerning (...) strong maximality (i.e. maximality w.r.t. rules instead of only axioms), we provide algebraic arguments in order to show that the logics L(i,n) are not strongly maximal w.r.t. CPL, even for n prime. Indeed, in such case, we show that there is just one extension between L(i,n) and CPL obtained by adding to L(i,n) a kind of graded explosion rule. Finally, using these results, we show that the logics L(i,n) with n prime and i/n < 1/2 are ideal paraconsistent logics. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed (...) is logarithmic in the number of truth values, and it is shown that this bound is tight. (shrink)

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances (...) propositional logics represented in various ways can be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the (...) proof theory of finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that (...) the optimal candidate matrices for (1) can be computed from the calculus. (shrink)

Non-Tarskian interpretations of many-valued logics have been widely explored in the logic literature. The development of non-tarskian conceptions of logical consequence set the theoretical foundations for rediscovering well-known (Tarskian) many-valued logics. One may find in distinct authors many novel interpretations of many-valued systems. They are produced through a type of procedure which consists in altering the semantic structure of Tarskian many-valued logics in order to output a non-Tarskian interpretation of these logics. Through (...) this type of transformation the paper explores a uniform way of transforming finitely many-valued Tarskian logics into their non-Tarskian interpretations. Some general properties of carrying out this type of procedure are studied, namely the dualities between these logics and the conditions under which negation-explosive and negation-complete Tarskian logics become non-explosive. (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one (...) of Gödel 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of (...) a truth value and the exclusion of the opposite truth value describe the same situation.). (shrink)

In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this paper I show that a number of logics are susceptible to a strengthened version of Curry's paradox. This can be adapted to provide a proof theoretic analysis of the omega-inconsistency in Lukasiewicz's continuum valued logic, allowing us to better evaluate which logics are suitable for a naïve truth theory. On this basis I identify two natural subsystems of (...) class='Hi'>Lukasiewicz logic which individually, but not jointly, lack the problematic feature. (shrink)

I apply Kooi and Tamminga's (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K3). First, I characterize each possible single entry in the truth-table of a unary or a binary truth-functional operator that could be added to K3 by a basic inference scheme. Second, I define a class of natural deduction systems on the basis of these characterizing basic inference schemes and a natural deduction system for K3. Third, I show that each of (...) the resulting natural deduction systems is sound and complete with respect to its particular semantics. Among other things, I thus obtain a new proof system for Lukasiewicz's three-valued logic. (shrink)

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures (...) are given. Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...) and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. (...) In this paper, we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi,\neg \varphi \vdash \psi$ and $\vdash \neg (\varphi \wedge \neg \varphi)$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above-mentioned are $\vdash \varphi, \neg \varphi$ and $\neg (\varphi \vee \neg \varphi) \vdash$. We call genuine paracomplete (...) class='Hi'>logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. A very natural twist structures semantics for these logics is also found in a systematic way. This semantics produces automatically a simple and elegant Hilbert-style characterization for all these logics. Finally, we introduce the logic LGP which is genuine paracomplete is not genuine paraconsistent, not even paraconsistent and cannot be characterized by a single finite logical matrix. (shrink)

We give a new and elementary construction of primitive positive decomposition of higher arity relations into binary relations on finite domains. Such decompositions come up in applications to constraint satisfaction problems, clone theory and relational databases. The construction exploits functional completeness of 2-input functions in many-valued logic by interpreting relations as graphs of partially defined multivalued ‘functions’. The ‘functions’ are then composed from ordinary functions in the usual sense. The construction is computationally effective and relies on well-developed methods (...) of functional decomposition, but reduces relations only to ternary relations. An additional construction then decomposes ternary into binary relations, also effectively, by converting certain disjunctions into existential quantifications. The result gives a uniform proof of Peirce’s reduction thesis on finite domains, and shows that the graph of any Sheffer function composes all relations there. (shrink)

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Etude de l'extension par la negation semi-intuitionniste de la logique positive des propositions appelee logique C, developpee par A. Urquhart afin de definir une semantique relationnelle valable pour la logique des valeurs infinies de Lukasiewicz (Lw). Evitant les axiomes de contraction et de reduction propres a la logique classique de Dummett, l'A. propose une semantique de type Routley-Meyer pour le systeme d'Urquhart (CI) en tant que celle-la ne fournit que des theories consistantes pour la completude de celui-ci.

Quantum information is discussed as the universal substance of the world. It is interpreted as that generalization of classical information, which includes both finite and transfinite ordinal numbers. On the other hand, any wave function and thus any state of any quantum system is just one value of quantum information. Information and its generalization as quantum information are considered as quantities of elementary choices. Their units are correspondingly a bit and a qubit. The course of time is what generates (...) choices by itself, thus quantum information and any item in the world in final analysis. The course of time generates necessarily choices so: The future is absolutely unorderable in principle while the past is always well-ordered and thus unchangeable. The present as the mediation between them needs the well-ordered theorem equivalent to the axiom of choice. The latter guarantees the choice even among the elements of an infinite set, which is the case of quantum information. The concrete and abstract objects share information as their common base, which is quantum as to the formers and classical as to the latters. The general quantities of matter in physics, mass and energy can be considered as particular cases of quantum information. The link between choice and abstraction in set theory allows of “Hume’s principle” to be interpreted in terms of quantum mechanics as equivalence of “many” and “much” underlying quantum information. Quantum information as the universal substance of the world calls for the unity of physics and mathematics rather than that of the concrete and abstract objects and thus for a form of quantum neo-Pythagoreanism in final analysis. (shrink)

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of being (...) true, what probability should be ascribed to other (query) sentences? A natural wish-list, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1, (iv) allows (Bayesian) inductive reasoning and (v) learning in the limit and in particular (vi) allows confirmation of universally quantified hypotheses/sentences. We translate this wish-list into technical requirements for a prior probability and show that probabilities satisfying all our criteria exist. We also give explicit constructions and several general characterizations of probabilities that satisfy some or all of the criteria and various (counter) examples. We also derive necessary and sufficient conditions for extending beliefs about finitely many sentences to suitable probabilities over all sentences, and in particular least dogmatic or least biased ones. We conclude with a brief outlook on how the developed theory might be used and approximated in autonomous reasoning agents. Our theory is a step towards a globally consistent and empirically satisfactory unification of probability and logic. (shrink)

The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution (...) and the Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (shrink)

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are (...) determined by a single finite logical matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

It is pointed out that the different concepts of the Universe serve as an ultimate basis determining the frames of consciousness. A unified concept of the Universe is explored which includes consciousness and matter as well to the universe of existents. Some consequences of the unified concept of the Universe are derived and shown to be able to solve the paradox of the self-founding notion of the Universe. The self-contained Universe is indicated to possess a logical nature. It is shown (...) that a passage exists between consciousness and the material world and its nature is exemplified. Moreover, arguments are presented showing the simultaneous emotional nature of the Universe. A solution to the paradox of semi-finite spacetime existents, possessing finite and infinite substances simultaneously, namely eternal existents like moral values and logical validity, is obtained. (shrink)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for (...) intuitionistic versions of the connectives in question. (shrink)

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means Hilbert-style calculi that are finite. On the negative side, we provide a syntactic condition on the equational presentation of a variety that entails failure of finite axiomatizability for the corresponding logic. An application of this result is that the logic of all distributive lattices with negation is not finitely axiomatizable; (...) we likewise establish that the order-preserving logic of the variety of all Ockham algebras is also not finitely axiomatizable. On the positive side, we show that an arbitrary subvariety of semi-De Morgan algebras is axiomatized by a finite number of equations if and only if the corresponding order-preserving logic is axiomatized by a finite Hilbert-style calculus. This equivalence also holds for every subvariety of a Berman variety of Ockham algebras. We obtain, as a corollary, a new proof that the implication-free fragment of intuitionistic logic is finitely axiomatizable, as well as a new corresponding Hilbert-style calculus. Our proofs are constructive in that they allow us to effectively convert an equational presentation of a variety of algebras into a Hilbert-style calculus for the corresponding order-preserving logic, and vice versa. We also consider the assertional logics associated to the above-mentioned varieties, showing in particular that the assertional logics of finitely axiomatizable subvarieties of semi-De Morgan algebras are finitely axiomatizable as well. (shrink)

This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend this constructive (...) method to non-classical fragments equipped with weaker implications (that avoid Curry's objection). This is the case, for example, of Jan Lukasiewicz's n-valued logics and Wilhelm Ackermann's logic of restricted implication. Besides such problems, both Henkin's method and the triviality phenomenon enable us to propose a new positive tableau proof system which uses only positive meta-linguistic resources, and to mo- tivate a new discussion concerning the role of negation in logic proposing the concept of paratriviality. In this way, some relations between positive reasoning and infinity, the possibilities to obtain a ¯first-order positive logic as well as the philosophical connection between truth and meaning are dis- cussed from a conceptual point of view. (shrink)

Growing-Block theorists hold that past and present things are real, while future things do not yet exist. This generates a puzzle: how can Growing-Block theorists explain the fact that some sentences about the future appear to be true? Briggs and Forbes develop a modal ersatzist framework, on which the concrete actual world is associated with a branching-time structure of ersatz possible worlds. They then show how this branching structure might be used to determine the truth values of future contingents. They (...) point out three different ways of interpreting the logical connectives, which give rise to three different logics of the open future: one supervaluationist, one corresponding to Lukasiewicz's strong Kleene logic, and one intuitionist. (shrink)

In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s (...) logic both with one (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered (...) by at least some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of (...) a flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a (...) class='Hi'>finite number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with (...) multiple contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

Why should we be means-end rational? Why care whether someone’s mental states exhibit certain formal patterns, like the ones formalized in causal decision theory? This paper establishes a dominance argument for these constraints in a finite setting. If you violate the norms of causal decision theory, then your desires will be aptness dominated. That is, there will be some alternative set of desires that you could have had, which would be more apt (closer to the actual values fixed by (...) your sensibility/ what you intrinsically care about) no matter which world is actual. If we care about having apt desires, then, we should never let ourselves violate these norms of means-end rationality. This argument shares a form with now-standard accuracy arguments for probabilism, opening up a new terrain for that discussion. I show that the foundational assumptions about the shape of accuracy and of aptness required to run the arguments for means-end rationality and for probabilism run closely parallel. I show the argument is robust under different theories of subjective actual value, including nonclassical treatments of indeterminacy in actual value; I show the argument may (but need not!) be generalized to objective theories of value. The upshot is that aptness-domination arguments for decision theories should be added to the philosophical playbook. (shrink)

One of the most prominent myths in analytic philosophy is the so- called “Fregean Axiom”, according to which the reference of a sentence is a truth value. In contrast to this referential semantics, a use-based formal semantics will be constructed in which the logical value of a sentence is not its putative referent but the information it conveys. Let us call by “Question Answer Semantics” (thereafter: QAS) the corresponding formal semantics: a non-Fregean many-valued logic, where the meaning of any (...) sentence is an ordered n-tupled of yes-no answers to corresponding questions. A sample of philosophical problems will be approached in order to justify the relevance of QAS. These include: (1) illocutionary forces, and the logical analysis of speech-acts; (2) the variety of logical negations, and their characterization in terms of restricted ranges of logical values; (3) change in meaning, and the use of dynamic oppositions for belief sets. (shrink)

Feynman's sum-over-histories formulation of quantum mechanics has been considered a useful calculational tool in which virtual Feynman histories entering into a coherent quantum superposition cannot be individually measured. Here we show that sequential weak values, inferred by consecutive weak measurements of projectors, allow direct experimental probing of individual virtual Feynman histories, thereby revealing the exact nature of quantum interference of coherently superposed histories. Because the total sum of sequential weak values of multitime projection operators for a complete set of orthogonal (...) quantum histories is unity, complete sets of weak values could be interpreted in agreement with the standard quantum mechanical picture. We also elucidate the relationship between sequential weak values of quantum histories with different coarse graining in time and establish the incompatibility of weak values for nonorthogonal quantum histories in history Hilbert space. Bridging theory and experiment, the presented results may enhance our understanding of both weak values and quantum histories. (shrink)

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching (...) theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument ultimately fails, (...) and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)

Predication is a lingual relation. We have this relation when a term is said (λέγεται) of another term. This simple definition, however, is not Aristotle’s own definition. In fact, he does not define predication but attaches his almost in a new field used word κατηγορεῖσθαι to λέγεται. In a predication, something is said of another thing, or, more simply, we have ‘something of something’ (ἓν καθ᾿ ἑνὸς). (PsA. , A, 22, 83b17-18) Therefore, a relation in which two terms are posited (...) to each other in a way that one is said (predicated) of the other is a predication. The term of which the other term is said is called a subject (ὑποκειμένον) and the other, which is said about the subject, is called the predicate. Thus, in a predication the predicate is predicated of the subject; given that being predicated is almost as the same as being said. The relation between being said and being predicated is so close that ‘if something is said of a subject both its name and its definition are necessarily predicated of the subject.’ (Cat., 5, 2a19-26) This, however, is true only about the second genera and not the accidents. a) Nature of relation in predication What is Aristotle’s theory about the nature of the relation in a predication? How does he fundamentally understand this relation? Phil Corkum distinguishes between predication logic and traditional term logic and argues that the relation between subject and predicate in Aristotle is of the latter kind. While in predicate logic, subjects and predicates have distinct roles, they have the same role in traditional term logic. In predication logic, subjects refer, but predicates characterize. Thereupon, a sentence expresses a truth if the object to which the subject refers is correctly characterized by the predicate. In traditional term logic, both subjects and predicates refer and a sentences expresses a truth if both name one and the same thing. He concludes that Aristotle ‘problematically conflates prediction and identity claims’ because while he thinks both subjects and predicates refer, he would deny that a sentence is true just in case the subject and the predicate name one and the same thing. Based on this, Corkum believes that Aristotle’s core semantic is not identity but the weaker relation of constitution, which is a mereological interpretation: ‘All men are mortal’ is true just in case the mereological sum of humans is part of the mereological sum of mortals. b) Aristotle’s theory of predication: one or two theories? Frank Lewis finds an inconsistent gap between the theory of predication in the Categories and that in the later books of the Metaphysics VII, 6. So too Joan Kung, Terry Irwin, Daniel Graham. c) Distinction of ‘being said of’ and ‘being in’ Owen enumerates the texts in which Aristotle’s distinction between ‘being said of’ and ‘being in’ is asserted: OI. 11b38-12a17; To., 127b1-4; Cat. 1a20-b9; 2a11-14; 2a27-b6; 2b15-17; 3a7-32; 9b22-24 d) Predication in Aristotle and the standard ‘S is P’ Marie De Rijk Lambertus thinks that the ‘S is P’ pattern is misleading when it comes to express predication in Aristotle. In his view, ‘The Aristotelian procedure should be described in terms of appositively assigning an attribute (κατηγορούμενον) to a substrate (ὑποκείμενον), rather than ascribing a predicate to a subject by means of a copula…. The comment should be considered an attribute which is said to fall to a substrate, without understanding this procedure in terms of sentence predication.’ e) Aristotle’s predication: bipartite or tripartite? It is a difficulty to make Aristotle’s theories of name-verb predication and tripartite predication consistent. The reason is that tripartite is not consistant with his name-verb structure based on which he says that the predicate term is the ‘verb.’ (20a31; 20b1-2; 16a13-5) The problem is that in a tripartite form like ‘Socrates is white’ we cannot take ‘is white’ as the verb because, based on Aristotle himself, no part of a verb can be significant itself. (16b6-7) However, his assertions about the equivalences between the two structures (OI. 12, 21b9-10; PrA. 51b13-16; Met., 1017b22-30) must mean that they are not inconsistent in his own view. Thus, as Allen Bāck points, ‘Aristotle seems to think that he has a single, consistent theory.’ The sense of saying or speaking as the root sense of rhema makes the relation between predication (saying something of something) and verb more interesting. The use of rhema in the sense of a long expression approves this. In Plato’s work (399ac) where Socrates claims that the name anthropos derives from anthron ha opopen (‘he who examines what he has seen’) we have an onoma from, or in place of, a rhema. 1) Subject The subject (ὑποκειμένον) is that of which another term is said or predicated. Aristotle’s own definition is of a much more philosophical value: ‘By subject I mean that which is expressed by an affirmative term (λέγω δὲ ὑποκείμενον τὸ κάταφάσει δηλούμενον).’ (Met., K, 1067b18) Throughout Aristotle’s work, three kinds of subjects can be found: possible, prime and absolute subject. a) Possible subject Those things that can take the position of a subject in a predication we call possible subjects, no matter they can or cannot take the position of predicate in any predication. All terms except the ultimate predicates are possible subjects because they can take the position of subject. b) Prime subject Those that in any predication can only take the position of a subject and not the position of a predicate are prime subjects. (Cat., 5, 3a36-b2; Met., Z, 1028b36-1029a1) This is the truest sense of subject and belongs only to substances. (Met., Z, 1029a1-2) In fact, ‘that which is not predicated of a subject, but of which all else is predicated’ is a substance. (Met., Z, 1029a7-9) In Categories, besides primary substances (Cat., 2, 1b3-6), individual qualities are also said not to be able to be said of anything else. (Cat., 2, 1a23-29) Aristotle’s examples are a certain ‘knowledge-of-grammar’ (τὶς γράμματικὴ) and ‘an individual white’ (τὸ τὶ λευκὸν). Thus, although substances are indeed in the truest sense individuals and, thereby, in the truest sense primary subjects, other individuals can take the position of subject as well. c) Absolute subject While substances are prime subjects of all other things, there is still something of which substances can be predicated and this predication is not an accidental predication: matter. (Met., Z, 1029a21-24) This predication is, indeed, the predication of a ‘form or this’ on matter and material substance. (Met., Θ, 1049a34-36) The only thing that is absolutely a subject, therefore, and can be a predicate is prime matter (πρώτη ὓλη). (Met., Θ, 1049a24-27) d) Subject and substance The most important thing in being a substance is being a subject: ‘It is because the primary substances are subjects for all the other things and all the other things are predicated of them or are in them, that they are called substances most of all.’ (Cat., 5, 2b15-17) And what is nearer to this position is more a substance as a species is more a substance than a genus.’ (Cat., 5, 2b7-8) e) Primary versus accidental subject A subject is a primary subject in a predication when the predicate is predicated of it as itself. In such a case, the subject is the subject of the predicate qua itself and not qua something else. A subject, on the one hand, is an accidental subject when it is not the primary subject of the predicate that is predicated on it. It means that a subject is an accidental subject when the predicate is predicated of it not qua itself but qua something else. An accidental subject is, therefore, anything other than a substance. 2) Predicate as universal It is evident from our discussion of kinds of subjects that except matter, primary substances (if we ignore both accidental predication and cases of absolute subjects) and other individuals, everything else can take the position of a predicate. Since primary substances are individuals, it results that everything except matter and individuals are capable to take the position of predicate. The immediate consequence of this is that the predicate must be a universal. When individuals cannot take the position of predicate, this position cannot be taken by any particular. Therefore, only universals can be predicated of others. Moreover, albeit universals can be a simple subject (for another universal), they are not prime subjects. The closeness of universal and predicate is to the extent that Aristotle differentiates universal from subject. (Met., Θ, 1049a27-30) 3) Categories or classes of predicates Aristotle distinguishes ten highest classes into one of which each predicate must necessarily fall: substance (or what a thing is), quality, quantity, relation, place, time, position, state, activity and passivity. (Cat., 4, 1b25-27; To., I, 9, 103b20- ; PsA., A, 22, 83b13-23) The substance counted among predicates must refer to secondary and not primary substances not only because Aristotle insists that primary substances cannot be predicated but also from his own examples of the category of substance: man and animal. (To., I, 9, 103b25) However, if a predicate be asserted of itself or its genus be asserted of it, the predicate signifies substance or what is; but if ‘one kind of predicate is asserted of another kind,’ it signifies one of the other nines. (To., I, 9, 103b30) These categories are so comprehensive that no predicate can remain outside them so that even non-being has as many senses as categories. (Met., M, 1089a26-30) a) That whether Aristotle’s categories are merely linguistic or fundamentally ontological is a so much controversial dispute. Some like G. E. R. Lloyd believe that ‘categories are primarily intended as a classification of reality … rather than of the signifying terms themselves.’ b) Although Aristotle’s categories have been historically regarded as a classification of predications, there are some recent commentators like Jonathan Barnes that think it is classifying predicates and not predications. 4) Kinds of predicates In his introduction of Categories, as J. W. Thorp truly points out , Aristotle distinguishes between the category of substance and the other categories using μὲν ... δὲ construction. This construction illustrates that beside tenfold classification of categories, there is an even more crucial differentiation between two kinds of predicates: substance or what is on the one hand and the other nine ones on the other hand: the distinction between what is predicated of the subject as what it is and what is predicated of it as an accident. Therefore, we have three kinds of classification - a twofold, a fourfold and a tenfold-complicatedly classifying the same thing, viz. the predicate. Predicates can be divided also to four kinds: property, definition, genus and accident. (To., I, 4, 101b11-20) A property is that predicate that is convertible with its subject and does not signify its essence. A definition is that predicate that is convertible with its subject and signifies its essence. It is a genus if it is not predicated convertibly and is contained in the definition of its subject. And it is an accident if it is neither convertible nor contained in the definition of its subject. (To., I, 8, ^103b3) All of these four kinds are among categories. (To., I, 9, 103b20) It seems that there might be some kind of relation between the twofold and the fourfold distinction: whereas genus and definition are predicated as what it is, accidents are not so predicated. There seems to be some rules that determine to each of these four kinds each predicate belongs. At To., IV, 123b30ff. Aristotle asserts: ‘If B has a contrary and A does not, then B does not belong to A as its genus.’ There is a dispute around per se accidents (τὰ καθ’ αὑτὰ συμβεβηκότα) (Topics., 102a18) whether they must be regarded as either of the four kinds or as a fifth kind. Barnes (1970) argued that they ‘do not fit at all neatly into the fourfold classification.’ He argues that based on the definition of accidents at A, 5, 102b4-5, they must be accidents but based on another definition, A, 5, 102b6-7, they cannot be accidents. He also defends the view that they are not properties. Barnes concludes: ‘This shows that the two definitions are not equivalent, and hence that the ‘predicables’ are not well-defined.’ Demetris J. Hadgopoulos defends the view that the two definitions of accidents are equivalent and per se accidents are properties. 5) Five types of predications We have five kinds of predications based on our division of subjects and our discussion of predicates: simple, primary (itself divided to substantial and accident), accidental (itself divided to primary and secondary), aoincidental and absolute predication. a) Simple predication. This is a predication in which a universal is predicated of either a particular or a universal subject. This sense of predication includes all other senses except the first kind of accidental predication. b) Primary predication. This is a predication in which a universal is predicated of a primary subject, namely a substance. A primary predication is of two kinds: i) Substantial predication. A primary predication in which the predicate is part of, or is included in, the definition of the subject. The universal that is the predicate here is the definition or the genus or the species or the diferentia of the subject. It is this predication that Aristotle calls a unity: ‘A statement may be called a unity … because it exhibits a single predicate as inhering not accidentally in a single subject.’ (PsA., B, 10, 93b35-37) It is only substantial predicates that can be predicated of each other: ‘Predicates which are not substantial are not predicated of one another.’ (PsA., A, 22, 83b18-19) Aristotle defines a substantial predication also in another way. A predication in which a higher genus is predicated on a lower genus, species, a substance or an individual, (or a species is predicated on an individual) is a substantial predication. Therefore, a substantial predication is a predication in a series that has individuals on one of its ends and a general category on its other end. In fact, only substantial predicates can be predicated of one another. (PsA., A, 22, 83b17-19) This series cannot be an infinite series because otherwise not only substances would not be definable but also a genus would be equal to one of its own species. (PsA., A, 22, 83b7-10) -/- ii) Accident predication. A primary predication in which the predicate is not part of, or is not included in, the definition of its subject. The universal that is the predicate here is the property or the accident of the subject. c) Accidental predication. This is a predication in which the subject is not a primary subject and its predicate is a substance. This predication is of two kinds: i) Primary accidental predication. This is a predication in which an accident is predicated of substance. Such a predication can go ad infinitum, which is inferable from Aristotle’s assertion that the secondary accidental predication cannot go ad infinitum. ii) Secondary accidental predication. It is a predication in which an accident is predicated of another accident. Such a predication, Aristotle asserts, cannot go ad infinitum because even more than two accidents cannot be combined. Now what is the meaning of Aristotle’s assertion that we cannot continue this ad infinitum? Does it mean that we cannot continue the predication ‘The musician is white’ and say ‘The white is Athenian?’ But why not? Or maybe he means that by adding any predication, we are still in a condition of predicating two accidents of a substance on each other. -/- As primary subjects, substances can also take the position of predicate though not essentially but accidentally. In propositions like ‘the white is a log’ or ‘That big thing is a log’ we observe substance taking the position of predicate but this is only accidentally: ‘When I affirm ‘the white is a log,’ I mean that something which happens to be white is a log- not that white is the subject in which log inheres (οὐχ ὡς τὸ ὑποκείμενον τῷ ξύλῳ τὸ λευκόν ἐστι), for it was not qua white or qua a species of white that the white (thing) came to be a log (οὔτε λευκὸν ὄν οὔθ᾿ ὃπερ λευκόν τι ἐγἐνετο ξύλον), and the white (thing) is consequently not a log except incidentally.’ (PsA., 22, 83a3-9) Aristotle compares this accidental use of substance in the position of predicate with the substantial use of it in the place of a subject: ‘On the other hand, when I affirm ‘the log is white,’ I do not mean that something else, which happens to be a log, is white (οὐχ ὃτι ἓτερόν τί ἐστι λευκόν, ἐκείνῳ δὲ συμβέβηκε ξύλῳ εἶναι), (as I should if I said ‘the musician is white,’ which would mean ‘The man who happens also to be a musician is white’); on the contrary, log is here the subject- the subject which actually came to be white, and did so qua wood or qua a species of wood and qua nothing else.’ (PsA., 22, 83a8-14) Aristotle asks us not to call propositions like ‘The white is a log’ a predication at all or at least call them accidental predication instead of simple (ἁπλως) predication. (PsA., A, 22, 83a14-17) An accidental predication, in which we have a substance in the place of predicate, is different from an essential predication in that while the subject of an accidental predication is said to be the predicate not by itself but as something different with which it coincides, the subject of an essential predicate is said to be the predicate by itself and not because it is something else: ‘Since there are attributes which are predicated of a subject essentially and not accidentally- not, that is, in the sense in which we say ‘That white (thing) is a man,’ which is not the same mode of predication as when we say ‘The man is white’: the man is white not because he is something else but because he is man, but the white is man because ‘being white’ coincides with ‘humanity’ within one subject. Therefore, there are terms such as are essentially subjects of predicates. (PsA., A, 19, 81a24-29) This capability of ‘non-essentially and only accidentally’ being a subject does belong, in fact, to all sensible things. (PsA., A, 27a32-36) d) Coincidental predication. this is a predication in which none of the subject and predicate are a substance or an individual. In this predication, one of the accidents of a substance or individual is predicated of one of the other accidentals of the same substance or individual. For example, when it is said that ‘The white is musical,’ there is an individual, say Socrates, for which both of white and musical are accidents. e) Absolute predication. This is a predication in which a form or a substance is predicated of a matter or a material substance. Some commentators like Loux and Lewis regarded this predication as close to accident predication, both based on inherence. As R.M. Dancy points out, these predications make Aristotle’s theory of predication immanentist: not only accident predications are explained by the immanence of accidents in substances, some of the substantial predications, which were not explained in Categories, are also explained by the immanence of form in matter. It is interesting that in this kind of predication, it is the predicate and not the subject, which is in the strictest sense substance. As the central books of Metaphysics claim, the form is the substance. Thus, in this predication, substance gets away from the sense of ὑποκείμενον. Corkum mentiones 68a19 as the only instance where Aristotle explicitly claims that a term may be predicated of itself, a passage that is, in Corkum’s view, problematic. 6) Demonstrable predicates Those predicates are demonstrable that are so related to their subjects that there are other predicates prior to them predicable of their subjects (ἔτι δ᾿ ἄλλος, εἰ ὧν πρότερα ἄττα κατηγορεῖται). (PsA., A, 22, 83b32-34) 7) Series of predications Since it is possible for a predicate to be itself the subject of another predication, we can have a series of predications in which the predicate of a predication is the subject of the next predication. This series has the following features: a) It has a limit (in number) (PsA., A, 22, 83b14-16) on the side of subjects: there are subjects that cannot themselves be predicated (PsA., A, 27, 43a39-41), which are, as we noted, prime subjects: particulars, i.e. prime substances and other individuals. (PsA., A, 19-22) Aristotle calls them ultimate (ὓστατον). (PsA., 21, 82a36-b1) b) It has a limit (in number of kinds) (PsA., A, 22, 83b14-16) also on the side of predicates: there must be predicates that cannot be subjects. (PsA., A, 19-22; PsA., A, 27, 43a36-39) Aristotle calls them primary (πρῶτον). (PsA., A, 21, 82b1-4) These are the highest categories or the highest genera of categories. (PsA., A, 22, 83b14-16) c) The series has an escalating shape from mere subjects at its downside to mere predicates at its upside. It is Aristotle himself whos uses the words up and down in this sense. (e.g. PsA., A, 22, 83b2-3) d) The predications that lie between lowest and highest ones must be finite in number. (PsA., A, 19-22 especially: 20, 82a21-35) These have subjects and predicates, each capable of both of the roles of being subject and being predicated. A result of this fitness is that neither demonstration can go to infinity nor everything is demonstrable, the two points Aristotle always insist on. e) The upward side includes the more universal ones and the downward the more particular ones. (PsA., 20, 82a21-23) f) It follows from the above features that ‘neither the ascending nor the descending series of predications … are infinite.’ (PsA., A, 22, 83b24-25) g) Reciprocation and convertibility. Except in case of terms (i.e. subjects and predicates) that are at each of the ends of series of predications, namely ultimates and primaries, it is possible to reciprocate (ἀντιστρέφειν) terms and convert the predication. (PsA., A, 19, 82a15-20) h) Antipredication. Antipredication means that in a predication (S is P), the subject becomes the predicate of its predicate (P is S) in the same category its predicate was predicated on it. For example, if P is in the category of quality, antipredication means that S be predicated of P in the category of quality. In other words, P is a quality of S and S is a quality of P. Aristotle rejects this. (PsA., A, 22, 83a36-b3) i) Self-predication versus other-predication. Aristotle distinguishes between a predication in which a term is said of itself and a predication in which a term is said of another. (Phy., Δ, 2, 209a31-33) j) Predicablity (Cat., 5, 3a36-b2): 1) Primary substances and individuals are not predicable. 2) Secondary substances are of two kinds: genus and species i) Genus is predicable able both of the species and of the individuals. ii) Species is predicable of the individual. 3) Differentiae are predicable both of the species and of the individuals. 8) Predication as classification a) Richard Patterson believes that Aristotle’s so repeated construction using hoper (estin A hoper B) in Topics (120a23 sq., 122b19, 26sq., 123a, 124a18, 125a29, 126a21, 128a35. Also in Posterior Analytics (83a24-30) (Brunschwig’s list. ‘expresses the fact that A is a kind of B (esti A B tis), that A is a species of the genus B.’ 9) Universal predication Aristotle defines universal predication (κατὰ παντὸς κατηγορεῖσθαι) as such: ‘wherever no instance of the subject (τῶν τοῦ ὑποκειμέμνου) can be found of which the other term cannot be asserted.’ (PrA., A, 24b27-29) In this predication, the subject is included in another as in a whole (ἐν ὃλῳ εἶναι) and the predicate is predicated of all of the subject (κατὰ παντὸς κατηγορεῖσθαι). (PrA., A, 24b26-27) Attach another discussion we had about ἐν ὃλῳ here. 10) Quantity of predication A predication, truly stated, has a quantity, which is the number of objects under the name of the subject of which the predicate is predicated. The quantity of subject can be stated in four ways: a. Indefinite: when the predicate belongs or does not belong to the subject without any mark to show to haw many of the particulars under the name of the subject it does or does not belong. E.g. ‘Man is white’; ‘Man is not white.’ (PrA., A, 24a20; OI., I, 7, 17b8-12) b. Universal quantity: When the predicate belongs to all or none of the subject. E.g. ‘Every man is animal’; ‘No man is animal.’ (PrA., A, 24a18-19; OI., I, 7, 17b5-6) The contrary of a predication of a universal quality is a predication of a universal quality. E.g. the contrary of ‘Every man is white’ is ‘No man is white.’ (OI., I, 7, 17b20-23) c. Particular quantity: When the predicate belongs (or does not belong) to some of the subject. E.g. ‘Some men are white’; ‘Some men are not white.’ (PrA., A, 24a19-20) d. Single quantity: when the subject is a proper name of only one object. E.g. ‘Socrates is white’; ‘Socrates is not white.’ The contrary of this predication is of a single quantity: ‘Socrates is not white.’ (OI., I, 7, 17b38-18a4) 11) Convertibility of predication. Some predications are convertible, that is, it is possible to change the place of subject and predicate in a true proposition so that the converted proposition remains true. This is supposed to mean that given the truth of a predication, the truth of the converted predication is inferable. The convert form of a predication depends on its quantity. a. Indefinite quantity: This predication has no strictly true convert because its quantity is not stated. b. Universal quantity: It can be converted in two ways: i) A negative universal can be converted to a negative universal in which the terms are changed. E.g. ‘No pleasure is good’ can be converted to ‘No good is pleasure.’ (PrA., A, 2, 25a5-8 and a14-19) ii) An affirmative universal can be converted to an affirmative particular in which the terms are changed. E.g. ‘Every pleasure is good’ can be converted to ‘Some good is pleasure.’ (PrA., A, 2, 25a7-9) c. Particular quantity: If it is negative, it cannot be converted but if it is affirmative, it can be converted to an affirmative predication with particular quantity. E.g. ‘Some pleasure is good’ can be converted to ‘Some good is pleasure.’ (PrA., A, 2, 25a10-13 and a20-24) d. Single quantity: It cannot be converted. 12) Characteristics of relations between subject and predicate 1. A predicate is of a wider range than its subject. It is based on this fact that Aristotle: a) Prevents individuals to be predicate because there is nothing of which an individual be of a wider range. In other words, it is due to the fact that since an individual is only ‘one particular’ thing and, thus, cannot be of a wider extent than anything that Aristotle prevents them of being a predicate. Matthews, however, thinks we cannot use Socrates, a substance and an individual, in the place of predicate and say it of Socrates because ‘Socrates does not classify Socrates: it names him.’ b) Prevents differentia, species and things under species to be predicated of genus. (To., Z, 6, 144a27-) c) Prevents the species and the things under it to be predicated of the differentia. (To., Z, 6, 144b1-4) d) Also about the effect because it is wider than its subject. (PsA., B, 17, 99a) e) Each attribute is wider than every individual it is predicated on, though several attributes, collectively considered, might not be wider but exactly the substance of a thing. (PsA., B, 13, 96a32-b1) 2. The predicate of a predicate of a subject will be predicated of the subject too: ‘whenever one thing is predicated of another as of a subject, all things said of what is predicated will be said of the subject too.’ (Cat., 3, 1b10-15) In fact, it is due to its predication of the subject that it is predicated of its predicate. (Cat., 5, 2a36-b1) Moreover, what is not predicated of the predicate of a subject cannot be predicated of it as well. (PrA., A, 27, 43b22-27) Thus, what, for example, is not predicated of animal, cannot be predicated of man. 3. The predicate of a subject can be predicated of its predicates as well. (Cat., 5, 3a1-6) For example, you call the individual man grammatical and, thence, you call both a man and an animal grammatical. Nonetheless, the predicate of a subject belongs to it more properly than to its higher predicates. (PrA., A, 27, 43a27-32) 4. It is only the subject that can be distributed and not the predicate. (PrA., A, 27, 43b16-22; OI, I, 7, 17b12-16) Therefore, we can say e.g. ‘Every man is animal’ but we cannot say ‘Every man is every animal.’ 5. It is the reason of the relation between subjects and predicates, that is the reason of predication, which is the subject of inquiry. (Met., Z, 1041a20-24) In other words, since it is a meaningless inquiry to ask why a thing is itself (Met., Z, 1041a14-15), the only remaining meaningful inquiry is to ask why something is something else, i.e. to ask about the reason of predication. 6. A subject cannot categorize its predicate in the same category in which it is categorized by it. If e.g. A is a quality of B, B cannot be a quality of A. Therefore, there is no reciprocation in the same category. (PsA., A, 22, 83a36-39) 13) Characteristics of series of predications 1. A series of secondary accidental predication cannot go ad infinitum for not even more than two terms can be comnbined. For an accident is not an accident of an accident, unless it be because both are accidents of the same subject. (Met., Γ, 1007b1-4) 2. Infinite series cannot be traversed in thought. (PsA., A, 22, 83b6-7) 3. The predications of genera on each other must be ended and cannot go to infinity because otherwise not only substances would not be definable but also a genus would be equal to one of its own species. (PsA., A, 22, 83b7-10) Therefore, a series of predication of genera on each other must be limited on both sides. There must be an upward limit in general categories as well as a downward limit in individual because they cannot be predicated of others. Whatever lies between these limits can both be predicated of others and others be predicated of them. (PrA., A, 27, 43a36-43) 4. The order of predicates matters: it makes a difference whether the series be ABC or BAC. (PsA., B, 13, 96b25-32) . (shrink)

The thesis that the two-valued system of classical logic is insufficient to explanation the various intermediate situations in the entity, has led to the development of many-valued and fuzzy logic systems. These systems suggest that this limitation is incorrect. They oppose the law of excluded middle (tertium non datur) which is one of the basic principles of classical logic, and even principle of non-contradiction and argue that is not an obstacle for things both to exist and to not (...) exist at the same time. However, contrary to these claims, there is no inadequacy in the two-valued system of classical logic in explanation the intermediate situations in existence. The law of exclusion and the intermediate situations in the external world are separate things. The law of excluded middle has been inevitably accepted by other logic systems which are considered to reject this principle. The many-valued and the fuzzy logic systems do not transcend the classical logic. Misconceptions from incomplete information and incomplete research are effective in these criticisms. In addition, it is also effective to move the discussion about the intellectual conception (tasawwur) into the field of judgmental assent (tasdiq) and confusion of the mawhum (imaginable) with the ma‘kûl (intellegible). (shrink)

(1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) I argue that, while (...) this line of thought provides some insights, it is importantly incomplete, as it is unable to explain why we should think. I consider two attempts at rescuing the line of thought. The first, unsuccessful response is that it is self-defeating to ask why we ought to think. The second response is that we need to think. But this response secures normativity only if thinking has some connection to human flourishing. (4) I argue that thinking is necessary for human flourishing. Logic is normative because it is constitutive of this good. (5) I show that the resulting account deals nicely with problems that vex other accounts of logical normativity. (shrink)

By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all (...) the axioms of ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

This article explores the question of how the members of the Lvov-Warsaw School promoted values that can be regarded as components of so-called logical culture. The author argues that these values are strictly connected with science. With references to Łukasiewicz, Czeżowski, and Kotarbiński,the article explores how values shape the logical culture and determines society as directed towards values. The article connects the meta-philosophical perspective with the philosophical one.

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, (...) in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)