This paper stresses the importance of identifying the nature of an author's conception of logic when using terms from modern logic in order to avoid, as far as possible, injecting our own conception of logic in the author's texts. Sundholm (2012. “‘Inference versus consequence” revisited: Inference, conditional, implication’, Synthese, 187, 943–956) points out that inferences are staged at the epistemic level and are made out of judgments, not propositions. Since it is now standard to read Aristotelian sullogismoi (...) as inferences, I have taken Alexander of Aphrodisias's commentaries to Aristotle's logical treatises as a basis for arguing that the premises and conclusions should be read as judgments rather than as propositions. Under this reading, when Alexander speaks of protaseis, we should not read the modern notion of proposition, but rather what we now call judgments. The point is not just a matter of terminology, it is about the conception of logic this terminology conveys. In this regard, insisting on judgments rather than on propositions helps bring to light Alexander's epistemic conception of logic. (shrink)

As an extension of the traditional theory of the syllogism, Leibniz’s algebra of concepts is built up from the term-logical operators of conjunction, negation, and the relation of containment.Leibniz’s laws of consistency state that no concept contains its own negation, and that if concept A contains concept B, then A cannot also contain Not-B. Leibniz believed that these principles would be universally valid, but he eventually discovered that they have to be restricted to self-consistent concepts.This result is of utmost (...) importance for the philosophical foundations of connexive logic, i.e. for the question how far either “Aristotle’s Thesis”, ¬(α → ¬α), or “Boethius’s Thesis”, (α → β) → ¬(α → ¬β), should be accepted as reasonable principles of a logic of conditionals. (shrink)

Having briefly sketched the aims of our paper, namely, to logically analyse the ascription of propositional attitudes to somebody else in terms, not of Fregean senses or of intensions-with-s, but of the intentional object of the person spoken about, say, the believer or intender (Section 1), we try to introduce the concept of an intentional object as simply as possible, to wit, as coming into view whenever two (or more) subjective belief-worlds strikingly diverge (Section 2). Then, we assess the (...) pros and cons of Frege’s view that the indirect reference of an expression is nothing but its customary sense (Sections 3–4), and call the reader’s attention to the fact that in belief ascriptions de re we take it for granted that the believer’s intentional object is at the same time a ‘citizen’ of the belief ascriber’s subjective world (or, for that matter, the real word), and that the idea of such a ‘dual citizenship’ is even more obviously presupposed in the cases of true belief and propositional knowledge (Section 5). Then, we try to argue that it is more fertile to take the belief ascriber’s intentional object to be, not the whole state of affairs the believer has in mind and thinks to exist, but the latter’s intentional object as such, that is, as being his intentional object (Section 6). Finally, we discuss the intricate and mostly neglected question of whether an intentional object’s inhabiting two or more subjective belief-worlds should be considered to be sort of a ‘transmundane identity’ in the numerical sense or rather in some deviant sense of the term, which can be specified as a momentous subcase of a ‘categorial difference’ (Section 7). (shrink)

I will show that the semantic structure of a new imperfect-information propositional logic can be described in terms of extensive forms of semantic games. I will discuss some ensuing properties of these games such as imperfect recall, informational consistency, and team playing. Finally, I will suggest a couple of applications that arise in physics, and most notably in quantum theory and quantum logics.

Ken López-Escobar questions the timeless status of various entities—propositions, numbers, etc.—as well as my characterization of pure propositional logic as an ontological theory. In my response I argue that my characterization of propositional logic does not depend on timeless propositions, or on other abstract truth bearers, but is a characterization in terms of truth relations between any truth bearers. I also discuss his views on numbers as cultural constructs, as well as his use of quantification in (...) propositional logic.Ken López-Escobar questiona o estatuto atemporal de vários entes—pro-posições, números, etc.— assim como minha caracterização da lógica proposicional pura como teoria ontológica. Na réplica argumento que minha caracterização não depende de proposições atemporais, ou de outros portadores de verdade abstratos, mas é uma caracterização em termos de relações de verdade entre quaisquer portadores de verdade. Examino também suas considerações sobre números como construtos culturais, assim como seu uso de quantificação na lógica proposicional. (shrink)

What good is logic? -- Seventeen ways this book is different -- The two logics -- All of logic in two pages : an overview -- The three acts of the mind -- I. The first act of the mind : understanding -- Understanding : the thing that distinguishes man from both beast and computer -- Concepts, terms and words -- The problem of universals -- The comprehension and extension of terms -- II. Terms -- Classifying terms -- (...) Categories -- Predicables -- Division -- III. Material fallacies -- Fallacies of language -- Fallacies of diversion -- Fallacies of oversimplification -- Fallacies of argumentation -- Inductive fallacies -- Procedural fallacies -- Metaphysical fallacies -- Short story : love is a fallacy -- IV. Definition -- The nature of definition -- The rules of definition -- The kinds of definition -- The limits of definition -- V. Second act of the mind : judgment -- Judgments, propositions, and sentences -- What is truth? -- The four kinds of categorical propositions -- Logical form -- Euler's circles -- Tricky propositions -- The distribution of terms -- VI. Changing propositions -- Immediate inference -- Conversion -- Obversion -- Contraposition -- VII. Contradiction -- What is contradiction? -- The square of opposition -- Existential import -- Tricky propositions on the square -- Some practical uses of the square of opposition -- VIII. The third act of the mind : reasoning -- What does reason mean? -- The ultimate foundations of the syllogism -- How to detect arguments -- Arguments vs. explanations -- Truth and validity -- IX. Different kinds of arguments -- Three meanings of because -- The four causes -- A classification of arguments -- Simple argument maps -- Deductive and inductive arguments -- Combining deduction and induction : socratic method -- X. Syllogisms -- The structure and strategy of the syllogism -- The skeptics objection to the syllogism -- The empiricist's objection to the syllogism -- Demonstrative syllogisms -- How to construct convincing syllogisms -- XI. Checking syllogisms for validity -- By Euler's circles -- By Aristotle's six rules -- Barbara Celarent : mood and figure -- Venn diagrams -- XII. More difficult syllogisms -- Enthymemes : abbreviated syllogisms -- Sorites : chain syllogisms -- Epicheiremas : multiple syllogisms -- Complex argument maps -- XIII. Compound syllogisms -- Hypothetical syllogisms -- Reductio ad absurdum arguments -- The practical syllogism : arguing about means and ends -- Disjunctive syllogisms -- Conjunctive syllogisms -- Dilemmas -- XIV. Induction -- What is induction? -- Generalization -- Causal induction : Mill's methods -- Scientific hypotheses -- Statistical probability -- Arguments from analogy -- A fortiori and a minore arguments -- XV. Some practical applications of logic -- How to write a logical essay -- How to write a socratic dialogue -- How to have a socratic debate -- How to use socratic method on difficult people -- How to read a book socratically -- XVI. Some philosophical applications of logic -- Logic and theology -- Logic and metaphysics -- Logic and cosmology -- Logic and philosophical anthropology -- Logic and epistemology -- Logic and ethics. (shrink)

A propositional framework of formal reasoning is proposed, which emphasises the pattern of entering and exiting context. Contexts are modelled by an algebraic structure which reflects the order and manner in which context is entered into and exited from.The equations of the algebra partitions context terms into equivalence classes. A formal semantics is defined, containing models that map equivalence classes of certain context terms to sets of interpretations of the formula language. The corresponding Hilbert system incorporates the algebraic equations (...) as axioms asserted in context.In semigroups of contexts, where combination of contexts is associative, finite ground algebraic equations correspond to contingent equivalence between certain logical formulas. Systems for sets and multisets of contexts are obtained by presenting their respective algebras as associativity plus finite ground equations. Soundness and completeness results are proved.Some contextual reasoning systems in the literature are inherently associative, and we present those as special cases. (shrink)

This presentation of a system of propositional logic is a foundational paper for systems of illocutionary logic. The language contains the illocutionary force operators '' for assertion and ' ' for supposition. Sentences occurring in proofs of the deductive system must be prefixed with one of these operators, and rules of take account of the forces of the sentences. Two kinds of semantic conditions are investigated; familiar truth conditions and commitment conditions. Accepting a statement A or rejecting (...) A commits a person to accepting some statements (the symbol '' marks this value), to rejecting some statements (), and will leave the person uncommitted with respect to others (). Commitment valuations assign the values to sentences of ; such a valuation is conceived as reflecting the beliefs/knowledge of a particular person. This paper explores the relations between truth conditions and commitment conditions, and between semantic concepts defined in terms of these conditions. (shrink)

One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T (...) and D, adding such machinery produces a decidable logic, but adding it to S5 produces an undecidable one. Further, if an equality symbol is in the language, and interpreted by the equality relation, logics from K4 to S5 yield undecidable versions. (Thus transitivity is the villain here.) The proof of undecidability consists in showing that classical first-order logic can be embedded. (shrink)

Some properties and an algorithm for solving systems of multivariate polynomial equations over finite fields are presented. It is then shown how formulas of propositional logics can be translated into polynomials over finite fields in such a way that several logic problems are expressed in terms of algebraic problems. Consequently, algebraic properties and algorithms can be used to solve the algebraically-represented logic problems. The methods described herein combine and generalise those of various previous works.

In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds to modern formulations of the logic of “not”, “and”, “or”, and “if…then…”. Along the way we prove a number of novel results about the system of propositional logic found in Grundgesetze, and the broader system obtained (...) by including identity. In particular, we show that the propositional connectives that are definable in terms of Frege’s horizontal, negation, and conditional are exactly the connectives that fuse with the horizontal, and we show that the logical operators that are definable in terms of the horizontal, negation, the conditional, and identity are exactly the operators that are invariant with respect to permutations on the domain that leave the truth-values fixed. We conclude with some general observations regarding how Frege understood his logic, and how this understanding differs from modern views. (shrink)

We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two players. This game-theoretic approach yields an interpretation where partiality is generated (...) as a property of non-determinacy of games. Over-defined values are produced by adding a weak, contradictory negation or, alternatively, by relaxing the assumption that games are strictly competitive. In general, particular forms of extensive imperfect information games give rise to a generalised propositional logic where various forms of informational dependencies and independencies of connectives can be studied. (shrink)

The book aims to formalise tableau methods for the logics of propositions and names. The methods described are based on Set Theory. The tableau rule was reduced to an ordered n-tuple of sets of expressions where the first element is a set of premises, and the following elements are its supersets.

This paper deals with various substructural propositional logics, in particular with substructural subsystems of Nelson's constructive propositional logics N– and N. Doen's groupoid semantics is extended to these constructive systems and is provided with an informational interpretation in terms of information pieces and operations on information pieces.

We define and investigate from a logical point of view a family of consequence relations defined in probabilistic terms. We call them relations of supporting, and write: |≈w where w is a probability function on a Boolean language. A |≈w B iff the fact that A is the case does not decrease a probability of being B the case. Finally, we examine the intersection of |≈w, for all w, and give some formal properties of it.

The intermediate logics have been classified into slices (cf. Hosoi [1]), but the detailed structure of slices has been studied only for the first two slices (cf. Hosoi and Ono [2]). In order to study the structure of slices, we give a method of a finer classification of slices & n (n 3). Here we treat only the third slice as an example, but the method can be extended to other slices in an obvious way. It is proved that each (...) subslice contains continuum of logics. A characterization of logics in each subslice is given in terms of the form of models. (shrink)

We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises properties of Brouwerian algebras.The equivalences have several consequences. Firstly, they provide new insights into databases that are not in first (...) normal form. Secondly, they characterise the implication of data dependencies in nested databases in purely logical terms. The database designer can take advantage of these equivalences to reduce database design problems to well-studied problems in Boolean propositional logic. Furthermore, relational database design solutions can be reused to solve problems for nested databases. (shrink)

Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normal-form theorems. On the basis of these works, Okada and Takemura reformulated Girard’s phase semantics so that it became phase semantics for proof-terms, i.e., lambda-terms. They formulated phase semantics for proof-terms of Laird’s dual affine/intuitionistic lambda-calculus and proved the normal-form theorem for Laird’s calculus via a completeness theorem. Their semantics was obtained by an application of computability predicates. In this (...) paper, we first formulate phase semantics for proof-terms of second-order intuitionistic propositional logic by modifying Tait-Girard’s saturated sets method. Next, we prove the completeness theorem with respect to this semantics, which implies a strong normalization theorem. (shrink)

We construct an extension P of the standard language of classical propositional logic by adjoining to the alphabet of a new category of logical-pragmatic signs. The well formed formulas of are calledradical formulas (rfs) of P;rfs preceded by theassertion sign constituteelementary assertive formulas of P, which can be connected together by means of thepragmatic connectives N, K, A, C, E, so as to obtain the set of all theassertive formulas (afs). Everyrf of P is endowed with atruth value (...) defined classically, and everyaf is endowed with ajustification value, defined in terms of the intuitive notion of proof and depending on the truth values of its radical subformulas. In this framework, we define the notion ofpragmatic validity in P and yield a list of criteria of pragmatic validity which hold under the assumption that only classical metalinguistic procedures of proof be accepted. We translate the classical propositional calculus (CPC) and the intuitionistic propositional calculus (IPC) into the assertive part of P and show that this translation allows us to interpret Intuitionistic Logic as an axiomatic theory of the constructive proof concept rather than an alternative to Classical Logic. Finally, we show that our framework provides a suitable background for discussing classical problems in the philosophy of logic. (shrink)

Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS). This semantics is given by a relation called support, explaining the meaning of the logical constants, which is parameterized by systems of rules called bases that provide the semantics of atomic propositions. In this paper, we interpret bases as collections of definite (...) formulae and use the operational view of them as provided by uniform proof-search—the proof-theoretic foundation of logic programming (LP)—to establish the completeness of IPL for the B-eS. This perspective allows negation, a subtle issue in P-tS, to be understood in terms of the negation-as-failure protocol in LP. Specifically, while the denial of a proposition is traditionally understood as the assertion of its negation, in B-eS we may understand the denial of a proposition as the failure to find a proof of it. In this way, assertion and denial are both prime concepts in P-tS. (shrink)

The formulas-as-types isomorphism tells us that every proof and theorem, in the intuitionistic implicational logic $H_\rightarrow$, corresponds to a lambda term or combinator and its type. The algorithms of Bunder very efficiently find a lambda term inhabitant, if any, of any given type of $H_\rightarrow$ and of many of its subsystems. In most cases the search procedure has a simple bound based roughly on the length of the formula involved. Computer implementations of some of these procedures were (...) done in Dekker. In this paper we extend these methods to full classical propositional logic as well as to its various subsystems. This extension has partly been implemented by Oostdijk. (shrink)

Infinitely many intermediate propositional logics with the disjunction property are defined, each logic being characterized both in terms of a finite axiomatization and in terms of a Kripke semantics with the finite model property. The completeness theorems are used to prove that any two logics are constructively incompatible. As a consequence, one deduces that there are infinitely many maximal intermediate propositional logics with the disjunction property.

The premise-fact confusion in Aristotle’s PRIOR ANALYTICS. -/- The premise-fact fallacy is talking about premises when the facts are what matters or talking about facts when the premises are what matters. It is not useful to put too fine a point on this pencil. -/- In one form it is thinking that the truth-values of premises are relevant to what their consequences in fact are, or relevant to determining what their consequences are. Thus, e.g., someone commits the premise-fact fallacy if (...) they think that a proposition has different consequences were it true than it would have if false. C. I. Lewis said that confusing logical consequence with material consequence leads to this fallacy. See Corcoran’s 1973 “Meanings of implication” [available on Academia. edu]. -/- The premise-fact confusion occurs in a written passage that implies the premise-fact fallacy or that suggests that the writer isn’t clear about the issues involved in the premise-fact fallacy. Here are some examples. -/- E1: If Abe is Ben and Ben swims, then it would follow that Abe swims. -/- Comment: The truth is that from “Abe is Ben and Ben swims”, the proposition “Abe swims” follows. Whether in fact Abe is Ben and Ben swims is irrelevant to whether “Abe swims” follows from “Abe is Ben and Ben swims”. -/- E1 suggests that maybe “Abe swims” wouldn’t follow from “Abe is Ben and Ben swims” if the latter were false. -/- E2: The truth of “Abe is Ben and Ben swims” implies that Abe swims. -/- E3: Indirect deduction requires assuming something false. -/- Comment: If the premises of an indirect deduction are true the conclusion is true and thus the “reductio” assumption is false. But deduction, whether direct or indirect, does not require true premises. In fact, indirect deduction is often used to determine that the premises are not all true. -/- Anyway, the one-page paper accompanying this abstract reports one of dozens of premise-fact errors in PRIOR ANALYTICS. In the session, people can add their own examples and comment on them. For example, is the one at 25b32 the first? What is the next premise-fact error after 25b32? Which translators or commentators discuss this? -/- . (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)

In Schwichtenberg, Schwichtenberg fine-tuned Tait’s technique so as to provide a simplified version of Gentzen’s original cut-elimination procedure for first-order classical logic. In this note we show that, limited to the case of classical propositional logic, the Tait–Schwichtenberg algorithm allows for a further simplification. The procedure offered here is implemented on Kleene’s sequent system G4. The specific formulation of the logical rules for G4 allows us to provide bounds on the height of cut-free proofs just in terms (...) of the logical complexity of their end-sequent. (shrink)

The connectives of classical propositional logic are given an analysis in terms of necessary and sufficient conditions of acceptance and rejection, i.e. the connectives are analyzed within an expressivist bilateral meaning-is-use framework. It is explained how such a framework differs from standard inferentialist frameworks and it is argued that it is better suited to address the particular issues raised by the expressivist thesis that the meaning of a sentence is determined by the mental state that it is conventionally (...) used to express. Furthermore, it is shown that the classical requirements governing the connectives completely characterize classical logic, are conservative and separable, are in bilateral harmony, are structurally preservative with respect to the classical coordination requirements and resolve the categoricity problem. These results are taken to show that one can give an expressivist bilateral meaning-is-use analysis of the connectives that confer on them a determinate coherent classical interpretation. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional (...) logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

This is the second part of a paper devoted to the study of the maximal intermediate propositional logics with the disjunction property , whose first part has appeared in this journal with the title “A method to single out maximal propositional logics with the disjunction property I”. In the first part we have explained the general results upon which a method to single out maximal constructive logics is based and have illustrated such a method by exhibiting the Kripke (...) semantics of maximal constructive logics extending the logic ST of Scott, for which, in turn, a semantical characterization in terms of Kripke frames has been given. In the present part we complete the illustration of the method of the first part, having in mind some aspects which might be interesting for a classification of the maximal constructive logics, and an application of the heuristic content of the method to detect the nonmaximality of apparently maximal constructive logics. Thus, on the one hand we introduce the logic AST , which is compared with ST and is seen as a logic “alternative” to it, in a sense which will be precisely explained. We provide a Kripke semantics for AST and show that there are maximal constructive logics which neither are extensions of ST nor are extensions of AST. Finally, we give a further application of the results of the first part by exhibiting the Kripke semantics of a maximal constructive logic extending AST. On the other hand, we compare the maximal constructive logics presented in both parts of the paper with a constructive logic introduced by Maksimova , which has been conjectured to be maximal by Chagrov and Zacharyashchev ; from this comparison a disproof of the conjecture arises. (shrink)

A method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser–Turquette axiom systems are definable in terms of the (...) class='Hi'>propositional connectives of Łukasiewicz’s logics, and thus, they are normal ones, then every Rosser–Turquette axiom system for a finite-valued Łukasiewicz’s logic is semantically incomplete. (shrink)

We show how mereotopological notions can be expressed by extending intuitionistic propositional logic with propositional quantification and a strong modal operator. We first prove completeness for the logics wrt Kripke models; then we trace the correspondence between Kripke models and topological spaces that have been enhanced with an explicit notion of expressible region. We show how some qualitative spatial notions can be expressed in topological terms. We use the semantical and topological results in order to show how (...) in some extensions of the logics it is possible to express connectedness, non-emptiness and a set of jointly exhaustive, pairwise disjoint, binary relations that play a significant role in qualitative spatial reasoning. (shrink)

The very existence of society depends on the ability of its members to influence formatively the beliefs, desires, and actions of their fellows. In every sphere of social life, powerful human agents (whether individuals or institutions) tend to use coercion as a favorite shortcut to achieving their aims without taking into consideration the non-violent alternatives or the negative (unintended) consequences of their actions. This propensity for coercion is manifested in the doxastic sphere by attempts to shape people’s beliefs (and doubts) (...) while ignoring the essential characteristics of these doxastic states. I argue that evidential persuasion is a better route to influence people’s beliefs than doxastic coercion. Doxastic coercion perverts the belief-forming mechanism and undermines the epistemic and moral faculties both of coercers and coercees. It succeeds sporadically and on short-term. Moreover, its pseudo doxastic effects tend to disappear once the use of force ceases. In contrast to doxastic coercion, evidential persuasion produces lasting correct beliefs in accordance with proper standards of evidence. It helps people to reach the highest possible standards of rationality and morality. Evidential persuasion is based on the principles of symmetry and reciprocity in that it asks all persuaders to use for changing the beliefs of others only those means they used in forming their own beliefs respecting the freedom of will and assuming the standard of rationality. The arguments in favor of evidential persuasion have a firm theoretical basis that includes a conceptual clarification of the essential traits of beliefs. Belief is treated as a hypercomplex system governed by Leibniz’s law of continuity and the principle of self-organization. It appears to be a mixture consisting of a personal propositional attitude and physical objects and processes. The conceptual framework also includes a typology of believers according to the standards of evidence they assume. In this context, I present a weak version of Clifford’ ethical imperative. In the section dedicated to the prerequisites for changing beliefs, I show how doxastic agents can infuse premeditated or planned changes in the flow of endogenous changes in order to shape certain beliefs in certain desired forms. The possibility of changing some beliefs in a planned manner is correlated with a feedback doxastic (macro-mechanism) that produces a reaction when it is triggered by a stimulus. In relation with the two routes to influence beliefs, a response mechanism is worth taking into consideration – a mechanism governed to a significant extent by human conscience and human will, that appears to be complex, acquired, relatively detached from visceral or autonomic information processing, and highly variable in reactions. Knowing increasingly better this doxastic mechanism, we increase our chances to use evidential persuasion as an effective (although not time-efficient) method to mold people’s beliefs. (shrink)

The essay first makes some observations on the general interrelationship between the logical writings of Albert and Buridan. Second, it gives an account of a ‘semantic logical model’ for analyzing complex subject terms in some basic categorical propositions which is defended by Albert of Saxony, and briefly recounts Buridan's criticisms of that model. Finally, the essay maintains that the Albertian model is typically compatible with, and a further development of, what is called by a late-fourteenth century anonymous scholar ‘the English-Rule’ (...) but the ‘determinable/determinate’ grammatical model defended by Buridan is not. (shrink)

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about (...) the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program Otter played an indispensable role in this study. (shrink)

In Iemhoff we gave a countable basis for the admissible rules of . Here, we show that there is no proper superintuitionistic logic with the disjunction property for which all rules in are admissible. This shows that, relative to the disjunction property, is maximal with respect to its set of admissible rules. This characterization of is optimal in the sense that no finite subset of suffices. In fact, it is shown that for any finite subset X of , for (...) one of the proper superintuitionistic logics Dn constructed by De Jongh and Gabbay ), all the rules in X are admissible. Moreover, the logic Dn in question is even characterized by X: it is the maximal superintuitionistic logic containing Dn with the disjunction property for which all rules in X are admissible. Finally, the characterization of is proved to be effective by showing that it is effectively reducible to an effective characterization of in terms of the Kleene slash by De Jongh. (shrink)

Resolution and cut-free LK are the most popular propositional systems used for logical automated reasoning. The question whether or not resolution and cut-free LK have the same efficiency on the system of CNF formulas has been asked and studied since 1960 425–467). It was shown in Cook and Reckhow, J. Symbolic Logic 44 36–50 that tree resolution has super-polynomial speed-up over cut-free LK. Naturally, the current issue is whether or not resolution and cut-free LK expressed as directed acyclic (...) graphs have the same efficiency. In this paper, we introduce a new algorithm to eliminate atomic cuts and show that cut-free LK polynomially simulates resolution when the input formula is expressed as a k-CNF formula. As a corollary, we show that regular resolution does not polynomially simulate cut-free LK . We also show that cut-free LK polynomially simulates regular resolution. (shrink)

Proposition and sentence are two separate entities indicating their specific purposes, definitions and problems. A proposition is a logical entity. A proposition asserts that something is or not the case, any proposition may be affirmed or denied, all proportions are either true (1’s) or false (0’s). All proportions are sentences but all sentences are not propositions. Propositions are factual contains three terms: subject, predicate and copula and are always in indicative or declarative mood. While sentence is a grammatical entity, a (...) unit of language that expresses a complete thought; a sentence may express a proposition, but is distinct from the proposition it may be used to express: categories, declarative sentences, exclamatory, imperative and interrogative sentences. Not all sentences are propositions, propositions express sentence. Sentence is a proposition only in condition when it bears truth values i.e. true or false. We use English sentences governed by imprecise rule to state the precise rules of proposition. In logic we use sentence as logical entity having propositional function but grammatical sentences are different from logical sentences while the former are having only two divisions namely subject and predicate and may express wishes, orders, surprise or facts and also have multiple subjects and predicates and the latter must be in a propositional form which states quantity of the subject and the quality of the proposition and multiple subjects and multiple predicate make the proposition multiple. (shrink)

We study term modal logics, where modalities can be indexed by variables that can be quantified over. We suggest that these logics are appropriate for reasoning about systems of unboundedly many reasoners and define a notion of bisimulation which preserves propositional fragment of term modal logics. Also we show that the propositional fragment is already undecidable but that its monodic fragment is decidable, and expressive enough to include interesting assertions.

“Arthur Prior’s Formal logic has been familiar to students for twenty years, but the historical section that was originally meant to accompany it was never published. In this book P. T. Geach and A. J. P. Kenny have selected from those parts of the material that were not superseded by Prior’s later publications a self-contained study of the philosophical prehistory of contemporary logic. Like Prior’s early work Logic and the Basis of Ethics the material here presented is (...) both historical and critical: Prior was not concerned to decide for us the controverted questions of logical doctrine which he discusses. He may be compared to an experienced judge summing up in a complicated civil action: the case for each side is clearly and fairly presented, and although on some issues the summing-up amounts to a pretty clear direction of the jury, the jurymen themselves are left to decide the issues. The value of such an historical survey is to be measured by the ill effects of ignoring our predecessors’ labours. The course of the philosophy of logic in the decades since Prior wrote these pages has continued to illustrate the saying that those who will not learn the history of philosophy are compelled to relive it.” - Publisher. (shrink)

In this paper we take up the question of the explanatory significance of the notion of propositional content. Our first goal is to disentangle two types of approach: According to what we call inflationism, propositions should be taken seriously enough to expect explanatory payoffs from them. The alternative deflationary approach rejects this claim. Our second goal is to explore the inflationism vs. deflationism contrast in depth by focusing on the distinction between singular and general propositions. We argue that inflationism (...) fails and outline a variety of deflationism that offers the best prospects for explaining the singular/general divide. (shrink)

Symmetric propositions over domain $\mathfrak{D}$ and signature $\Sigma = \langle R^{n_1}_1, \ldots, R^{n_p}_p \rangle$ are characterized following Zermelo, and a correlation of such propositions with logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$ is described. Boolean algebras of symmetric propositions over $\mathfrak{D}$ and Σ are shown to be isomorphic to algebras of logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$. This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only those (...) invariant under domain permutations. (shrink)

// tl;dr A Proposition is a Way of Thinking // -/- This chapter is about type-theoretic approaches to propositional content. Type-theoretic approaches to propositional content originate with Hintikka, Stalnaker, and Lewis, and involve treating attitude environments (e.g. "Nate thinks") as universal quantifiers over domains of "doxastic possibilities" -- ways things could be, given what the subject thinks. -/- This chapter introduces and motivates a line of a type-theoretic theorizing about content that is an outgrowth of the recent literature (...) on epistemic modality, according to which contentful thought is broadly "informational" in its nature and import. The general idea here is that an object of thought is not a way *the world* could be, but rather a way *one's perspective* could be (with respect to a relevant representational question). I will spend the middle part of this chapter motivating and developing a version of this strategy that is, I’ll argue, well-suited to explaining clear phenomena concerning the attribution of perspectival attitudes -- in particular, attitudes towards loosely information-sensitive propositions -- with which extant approaches struggle. My overarching goal here will be to motivate a distinctive version of the "informational" approach -- the "Flexible Types" approach, which is based on the theory proposed in Charlow (2020). According to the Flexible Types approach, propositional attitude verbs are quantifiers over sets of possibilities, but a possibility is a type-flexible notion -- sometimes a possible world, sometimes a perspective, sometimes a set of possible worlds, sometimes a set of perspectives. -/- After introducing the Flexible Types approach, this chapter circles back to more traditional concerns for the analysis of propositions as types of possibilities -- Frege's Puzzle and the problem of Logical Omniscience. Here too the Flexible Types approach bears fruit. Although there are certainly significant differences -- I note some in the concluding section -- the gist of this theory is Hinitkkan or Lewisian in spirit (if not quite in letter). We can make progress on addressing the challenges for the analysis of propositional content in terms of types of possibilities, through empirically driven refinement of our notion of what kind of thing a "doxastic possibility" is. (shrink)

The words "analysis" and "synthesis" are among the most widely used and misused terms in the history of philosophy. They were originally used in geometrical reasoning during the age of Euclid to describe two opposing, but complementary, methods of arguing (roughly equivalent to deduction and induction). Since then philosophers have used them not only in this way, but also to refer to distinctions of various sorts between types of judgment or classes of propositions. To some they are regarded as defining (...) differences of kind, while others regard them as defining differences of degree. Moreover, they have been connected in numerous different ways with other distinctions, such as "a priori vs. a posteriori" or "necessary vs. contingent". Some philosophers have become so frustrated at the ambiguity attached to the various uses of the terms "analytic" and "synthetic" that they have given up all hope of assigning a coherent meaning to this distinction. (shrink)

1. Belief and mental statesDavidson holds that intentional verbs occurring in the form ‘A Vs that p’ signify propositional attitudes. These are, he claims, mental states, and dispositions. Davidson does not conceive of himself as introducing a special technical sense of the common intentional verbs. He insists that ‘the mental states in question are beliefs, desires, intentions, and so on, as ordinarily conceived'. Consequently he contends that believing that p is a mental state, disposition or dispositional state. These ontological (...) claims about the nature of belief inform his account of the logical form of belief sentences. I shall address the question of whether believing that p can justly be deemed a mental state, a disposition or dispositional state. Subsequently I shall examine Davidson's account of the logical form of belief sentences.Our concept of a mental state, like so many of the concepts which philosophers treat as categorial, is none too sharply defined. It has a respectable use, which can be described. But, like other such general psychological terms, e.g. ‘mental process’, ‘mental activity’, far from being the ‘hardest of the hard’ - a sharply circumscribed categorial term akin to a variable in a well-constructed formal system — it has blurred boundaries and is elastic. Like all our ordinary psychological concepts, it evolved in order to meet everyday needs. As Wittgenstein observed, ‘The concepts of psychology are just everyday concepts. They are not concepts newly fashioned by science for its own purposes, as are the concepts of physics and chemistry.’Although our ordinary concepts can be replaced by technical ones for specialized purposes, they cannot be abused without generating conceptual confusion and incoherence. If the expression ‘mental state’ is being employed in its ordinary sense, then it is wrong to hold that believing that p is to be in any mental state. If it is being employed in a special technical sense, then those who employ it thus owe us an account of what it means and how it is to be used. This Davidson and the many other philosophers who subscribe to the view that believing is a mental state have not done. Until such an account is forthcoming, one may presume that they think of themselves as deploying our ordinary concept of a mental state. And if so, I shall argue, they are misusing it. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:76 Reviews PROPOSITIONAL ANALYSIS David Blitz Philosophy Dept. and Peace Studies / Central Connecticut State U. New Britain, ct 06050, usa blitz@mail.ccsu.edu Graham Stevens. The Russellian Origins of Analytical Philosophy: Bertrand Russell and the Unity of the Proposition. London and New York: Routledge, 2005. Pp. xii, 185. isbn: 978-0-415-36044-9 (hb). £80.00. us$155.95. Graham Stevens has written a short book on a diUcult subject: the unity of the proposition. (...) While the title of the volume is The Russellian Origins of Analytic Philosophy, the underlying theme is the comparatively little discussed problem of how the elements of a proposition come together to form a unity, as indicated in the book’s subtitle: “Bertrand Russell and the Unity of the Prop­ osition”. Stevens traces this concept, as a unifying thread or “central concern”, throughout Russell’s many philosophies which constitute for Stevens a “consis­ tent and constantly evolving philosophy” (p. 2) stretching from the earliest log­ ical writings to the later works of the 1930s and 1940s. This is an important and well written volume, which Russellians should have in their personal and uni­ versity libraries. That the “unity of the proposition” is a problem at all requires the reader to return to the neo-Hegelian idealism which Russell encountered as a student at Cambridge.1 Russell, inXuenced by Peano and Frege, broke with the doctrine of internal relations, defended by Bradley and others, according to which external relations are unreal and false appearance. However, an important element of idealism remains even during the Principia period, due to Russell’s continued belief that a proposition is a non-linguistic, non-mental, abstract entity; these elements are all of the same ontological kind, which can be identiWed through analysis and recombined so that their synthesis reconstitutes the original “unity of the proposition”. This turns out to be a very tall order which will occupy Russell for nearly half a century. Consider the standard example Russell gives: “Desdemona loves Cassio”. According to Russell, this proposition (independently of its truth or falsity) actually contains its “simple constituents”z—zwith “Desdemona” and “Cassio” being things and “loves” a concept. Russell, as a founder of analytic philosophy, has to defend the legitimacy of this analysis from the claim that it has reduced 1 Chapter 1: “Russell, Frege and the Analysis of Unities”. December 2, 2009 (5:28 pm) E:\CPBR\RUSSJOUR\TYPE2901\russell 29,1 060 red.wpd E:\CPBR\RUSSJOUR\TYPE2901\russell 29,1 060 red.wpd Reviews 77 the structured unity of the proposition into an unstructured set of parts (or heap) where the original order of combination has been lost. The problem of is that merely listing “Desdemona”, “Cassio” and “loves” does not indicate the way in which the terms were originally combined or re­ lated. For reasons to be made clear later, this is referred to in the literature as the “narrow order problem”. In particular, the question arises as to how analysis enables us to assert that it is Desdemona who loves Cassio (supposing this to be the case), rather than the other way around (since love may not be requited). Stevens deals with logical form in a later chapter devoted to the problem of belief statements, but the notion applies here as well: analysis seems to have skip­ ped the logical form, the way in which the constituents are combined. But if the logical form is included, then there seems to be an extra constituent in the prop­ osition not given by direct inspection, and analysis would appear to have added something above and beyond what was there before the analysis. Adding linking relations to indicate how the components were originally combined does not help either. If there is some relation Lz which relates “Desdemona” and “loves” and another relation Rz which relates “loves” and “Cassio”, then there are Wve constituents, not three. Moreover, there is now room for inWnite regress, with a relation L2 linking “Desdemona” and L, R2 linking “loves” and “Cassio”, and so on. But without adding these additional items, there is an apparent failure of an­ alysis to fully provide the order of the elements present in the original... (shrink)

Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such asreductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. (...) In the 17th century, this Peripatetic program of reducing hypothetical to categorical logic was championed by Gottfried Wilhelm Leibniz. In an essay titledSpecimina calculi rationalis, Leibniz develops a theory of propositional terms that allows him to derive the rule ofreductio ad absurdumin a purely categorical calculus in which every proposition is of the formA is B. We reconstruct Leibniz’s categorical calculus and show that it is strong enough to establish not only the rule ofreductio ad absurdum, but all the laws of classical propositional logic. Moreover, we show that the propositional logic generated by the nonmonotonic variant of Leibniz’s categorical calculus is a natural system of relevance logic known as RMI$_{{}_ \to ^\neg }$. (shrink)

PAPERS IN LOGIC AND ETHICS by A. N. Prior. Duckworth, 1976. 233 pp. £8.95.THE DOCTRINE OF PROPOSITIONS AND TERMS by A. N. Prior. Duckworth, 1976. 143 pp. £5.95.

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order (...) predicate logic. Over [0, 1], the operator * is undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. Parameters of the required kind can be obtained as so-called projections of lawless sequences. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic.Over [0, 1], (...) the operator * is (constructively and classically) undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. (shrink)