In this chapter, I discuss some problems of Kant’s logic corpus while recognizing its richness and potential value. I propose and explain a methodic way to approach it. I then test the proposal by showing how we may use various mate- rials from the corpus to construct a Kantian demonstration of the formal rules of thinking (or judging) that lie at the base of Kant’s Metaphysical Deduction. The same proposal can be iterated with respect to other topics. The said (...) demonstration will have cleared the path for such iterations. (shrink)

In the theory of meaning, it is common to contrast truth-conditional theories of meaning with theories which identify the meaning of an expression with its use. One rather exact version of the somewhat vague use-theoretic picture is the view that the standard rules of inference determine the meanings of logical constants. Often this idea also functions as a paradigm for more general use-theoretic approaches to meaning. In particular, the idea plays a key role in the anti-realist program of (...) Dummett and his followers. In the theory of truth, a key distinction now is made between substantial theories and minimalist or deflationist views. According to the former, truth is a genuine substantial property of the truth-bearers, whereas according to the latter, truth does not have any deeper essence, but all that can be said about truth is contained in T-sentences (sentences having the form: ‘P’ is true if and only if P). There is no necessary analytic connection between the above theories of meaning and truth, but they have nevertheless some connections. Realists often favour some kind of truth-conditional theory of meaning and a substantial theory of truth (in particular, the correspondence theory). Minimalists and deflationists on truth characteristically advocate the use theory of meaning (e.g. Horwich). Semantical anti-realism (e.g. Dummett, Prawitz) forms an interesting middle case: its starting point is the use theory of meaning, but it usually accepts a substantial view on truth, namely that truth is to be equated with verifiability or warranted assertability. When truth is so understood, it is also possible to accept the idea that meaning is closely related to truth-conditions, and hence the conflict between use theories and truth-conditional theories in a sense disappears in this view. (shrink)

In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj, j = 1… k, is analyzed, in the independent setup. The e-value of a hypothesis H, ev, is a Bayesian epistemic, credibility or truth value defined under the Full Bayesian Significance Testing mathematical apparatus. The questions addressed concern the important issue of how the truth value of H, and the truth function of the corresponding FBST structure M, relate to (...) the truth values of its elementary constituents, Hj, and to the truth functions of their corresponding FBST structures Mj, respectively. (shrink)

A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that (...) deductions in normal form have the subformula property. (shrink)

The aim of the paper is to argue that all—or almost all—logical rules have exceptions. In particular, it is argued that this is a moral that we should draw from the semantic paradoxes. The idea that we should respond to the paradoxes by revising logic in some way is familiar. But previous proposals advocate the replacement of classical logic with some alternative logic. That is, some alternative system of rules, where it is taken for granted that these (...) hold without exception. The present proposal is quite different. According to this, there is no such alternative logic. Rather, classical logic retains the status of the ‘one true logic’, but this status must be reconceived so as to be compatible with (almost) all of its rules admitting of exceptions. This would seem to have significant repercussions for a range of widely held views about logic: e.g. that it is a priori, or that it is necessary. Indeed, if the arguments of the paper succeed, then such views must be given up. (shrink)

Once upon a time, logical conventionalism was the most popular philosophical theory of logic. It was heavily favored by empiricists, logical positivists, and naturalists. According to logical conventionalism, linguistic conventions explain logical truth, validity, and modality. And conventions themselves are merely syntactic rules of language use, including inference rules. Logical conventionalism promised to eliminate mystery from the philosophy of logic by showing that both the metaphysics and epistemology of logic fit into a scientific (...) picture of reality. For naturalists of all stripes, this was paradise. Alas, paradise was lost. By the end of the twentieth century, logical conventionalism had been almost universally abandoned. But more recently, it has been revitalized. This chapter provides an overview of logical conventionalism and its history, clears away misunderstandings, and briefly responds to both the canonical objections to conventionalism (from Quine, Dummett, Boghossian, and many others) as well as new objections (from Field and Golan). From paradise lost, to paradise regained: logical conventionalism is back. (shrink)

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule (...) for implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic. (shrink)

In this paper I argue that pluralism at the level of logical systems requires a certain monism at the meta-logical level, and so, in a sense, there cannot be pluralism all the way down. The adequate alternative logical systems bottom out in a shared basic meta-logic, and as such, logical pluralism is limited. I argue that the content of this basic meta-logic must include the analogue of logical rules Modus Ponens and Universal Instantiation. I (...) show this through a detailed analysis of the ‘adoption problem’, which manifests something special about MP and UI. It appears that MP and UI underwrite the very nature of a logical rule of inference, due to all rules of inference being conditional and universal in their structure. As such, all logical rules presuppose MP and UI, making MP and UI self-governing, basic, unadoptable, and required in the meta-logic for the adequacy of any logical system. (shrink)

In this book set theory INC# based on intuitionistic logic with restricted modus ponens rule is proposed. It proved that intuitionistic logic with restricted modus ponens rule can to safe Cantor naive set theory from a triviality. Similar results for paraconsistent set theories were obtained in author papers [13]-[16].

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

This note corrects an error in my paper 'Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule' (Archive for Mathematical Logic 61 (2022): 105-129, DOI 10.1007/s00153-021-00775-6): Theorem 2 is mistaken, and so is a corollary drawn from it as well as a corollary that was concluded by the same mistake. Luckily this does not affect the main result of the paper.

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems (...) to change this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

This tutorial is for beginners wanting to learn the basics of propositional logic; the simplest of the formal systems of logic. Leslie Allan introduces students to the nature of arguments, validity, formal proofs, logical operators and rules of inference. With many examples, Allan shows how these concepts are employed through the application of three different methods for proving the formal validity of arguments.

In this article Russell’s paradox and Cantor’s paradox resolved successfully using intuitionistic logic with restricted modus ponens rule.

In Tractatus 5.132 Wittgenstein argues that inferential justification depends solely on the understanding of the premises and conclusion, and is not mediated by any further act. On this basis he argues that Frege’s and Russell’s rules of inference are “senseless” and “superfluous”. This line of argument is puzzling, since it is unclear that there could be any viable account of inference according to which no such mediation takes place. I show that Wittgenstein’s rejection of rules of inference can (...) be motivated by taking account of his holistic construal of the relation between inference and understanding. (shrink)

We analyze the logical form of the domain knowledge that grounds analogical inferences and generalizations from a single instance. The form of the assumptions which justify analogies is given schematically as the "determination rule", so called because it expresses the relation of one set of variables determining the values of another set. The determination relation is a logical generalization of the different types of dependency relations defined in database theory. Specifically, we define determination as a relation between schemata (...) of first order logic that have two kinds of free variables: (1) object variables and (2) what we call "polar" variables, which hold the place of truth values. Determination rules facilitate sound rule inference and valid conclusions projected by analogy from single instances, without implying what the conclusion should be prior to an inspection of the instance. They also provide a way to specify what information is sufficiently relevant to decide a question, prior to knowledge of the answer to the question. (shrink)

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

In this book set theory INC# based on intuitionistic logic with restricted modus ponens rule is proposed. It proved that intuitionistic logic with restricted modus ponens rule can to safe Cantor naive set theory from a triviality.

ABSTRACT: A detailed presentation of Stoic theory of arguments, including truth-value changes of arguments, Stoic syllogistic, Stoic indemonstrable arguments, Stoic inference rules (themata), including cut rules and antilogism, argumental deduction, elements of relevance logic in Stoic syllogistic, the question of completeness of Stoic logic, Stoic arguments valid in the specific sense, e.g. "Dio says it is day. But Dio speaks truly. Therefore it is day." A more formal and more detailed account of the Stoic theory of deduction can (...) be found in S. Bobzien, Stoic Syllogistic, OSAP 1996. (shrink)

This essay advances and develops a dynamic conception of inference rules and uses it to reexamine a long-standing problem about logical inference raised by Lewis Carroll’s regress.

We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.

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

This self-contained one page paper produces one valid two-premise premise-conclusion argument that is a counterexample to the entire three traditional rules of distribution. These three rules were previously thought to be generally applicable criteria for invalidity of premise-conclusion arguments. No longer can a three-term argument be dismissed as invalid simply on the ground that its middle is undistributed, for example. The following question seems never to have been raised: how does having an undistributed middle show that an argument's (...) conclusion does not follow from its premises? This result does nothing to vitiate the theories of distribution developed over the period beginning in medieval times. What it does vitiate is many if not all attempts to use distribution in tests of invalidity outside of the standard two-premise categorical arguments—where they were verified on a case-by-case basis without further theoretical grounding. In addition it shows that there was no theoretical basis for many if not all claims of fundamental status of rules of distribution. These results are further support for approaching historical texts using mathematical archeology. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in (...) just those models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

This paper considers the question of what knowing a logical rule consists in. I defend the view that knowing a logical rule is having propositional knowledge. Many philosophers reject this view and argue for the alternative view that knowing a logical rule is, at least at the fundamental level, having a disposition to infer according to it. To motivate this dispositionalist view, its defenders often appeal to Carroll’s regress argument in ‘What the Tortoise Said to Achilles’. I (...) show that this dispositionalist view, and the regress that supposedly motivates it, operate with the wrong picture of what is involved in knowing a logical rule. In particular I show that it gives us the wrong picture of the relation between knowing a logical rule and actions of inferring according to it, as well as of the way in which knowing a logical rule might be a priori. (shrink)

I briefly consider why Descartes stopped work on the _Rules_ towards the end of my paper. My main concern is to accurately characterize the project represented in the _Rules_, especially in its relation to early-modern logic.

ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles of propositional logic; 4. (...) Stoic modal logic; 5. Stoic theory of arguments: two premisses requirement; validity and soundness; 6. Stoic syllogistic or theory of formally valid arguments: a reconstruction of the Stoic deductive system, which consisted of accounts of five types of indemonstrable syllogisms, which function as nullary argumental rules that identify indemonstrables or axioms of the system, and four deductive rules (themata) by which certain complex arguments can be reduced to indemonstrables and thus shown to be formally valid themselves; 7. arguments that were considered as non-syllogistically valid (subsyllogistic and unmethodically concluding arguments). Their validity was explained by recourse to formally valid arguments. (shrink)

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. (...) Moreover, the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

According to Amie Thomasson's Modal Normativism (MN), knowledge of metaphysical modality is to be explained in terms of a speaker’s mastery of semantic rules, as opposed to one’s epistemic grasp of independent modal facts. In this chapter, I outline (MN)'s account of modal knowledge (§1) and argue that more than semantic mastery is needed for knowledge of metaphysical modality. Specifically (§2), in reasoning aimed at gaining such knowledge, a competent speaker needs to further deploy essentialist principles and information. In (...) response, normativists might contend that a competent speaker will only need to appeal to specific independence counterfactuals, on analogy with quasi-realism about morality. These conditionals fix the meaning of our terms at the actual world, independently of the particular context in which a statement is evaluated. However, I show that this strategy causes several problems for the account (§3). While those problems might perhaps be avoided by endorsing a certain picture of modal metaphysics (Modal Monism), such a picture involves notorious issues that normativists will have to address (§4). It is thus doubtful that (MN) can explain knowledge of metaphysical modality. Still, it may explain some modal knowledge without committing to Modal Monism. As I show (§5), semantic mastery may suffice for gaining knowledge of logical-conceptual modality or analyticity. (shrink)

This chapter intervenes in recent debates in Kant scholarship about the possibility of a general logical alien. Such an alien is a thinker whose laws of thinking violate ours. She is third-personal as she is radically unlike us. Proponents of the constitutive reading of Kant’s conception of general logic accordingly suggest that Kant rules out the possibility of such an alien as unthinkable. I add to this an often-overlooked element in Kant’s thinking: there is reason to think that (...) he grants—and in fact presupposes—the possibility of a transcendental logical alien. Such an alien is a knower whose laws of experience purport to violate ours. She is first-personal as she is radically like us. In other words, she is us, insofar as we are alienated from ourselves and our experience. I go on to draw an analogy between her, a dogmatist, and another transcendental alien, an evil agent. Just as a dogmatist is alienated from her (our) experiential laws, an evil agent is alienated from her (our) moral law. These forms of theoretical and practical self-conceit require self-knowledge in the form of a critique of speculative or practical reason. In bringing this point out, I aim to shift from the question of whether logical laws constitute our thinking to the question of whether grasping our experiential and moral laws as our laws constitutes our reason. (shrink)

Traditionally transcendental logic has been set apart from formal logic. Transcendental logic had to deal with the conditions of possibility of judgements, which were presupposed by formal logic. Defined as a purely philosophical enterprise transcendental logic was considered as being a priori delivering either analytic or even synthetic a priori results. In this paper it is argued that this separation from the (empirical) cognitive sciences should be given up. Transcendental logic should be understood as focusing on specific questions. These do (...) not, as some recent analytic philosophy has it, include a refutation of scepticism. And they are not to be separated from meta-logical investigations. Transcendental logic properly understood, and redefined along these theses, should concern itself with the (formal) re-construction of the presupposed necessary conditions and rules of linguistic communication in general. It aims at universality and reflexive closure. (shrink)

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)

This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...) logic appears surprisingly modern: a recursively formulated syntax with some truth-functional propositional operators; analogues to cut rules, axiom schemata and Gentzen’s negation-introduction rules; an implicit variable-sharing principle and deliberate rejection of Thinning and avoidance of paradoxes of implication. These latter features mark the system out as a relevance logic, where the absence of duals for its left and right introduction rules puts it in the vicinity of McCall’s connexive logic. Methodologically, the choice of meticulously formulated meta-logical rules in lieu of axiom and inference schemata absorbs some structural rules and results in an economical, precise and elegant system that values decidability over completeness. (shrink)

This book concerns the metasemantics of quantum mechanics (QM). Roughly, it pursues an investigation at an intersection of the philosophy of physics and the philosophy of semantics, and it offers a critical analysis of rival explanations of the semantic facts of standard QM. Two problems for such explanations are discussed: categoricity and permanence of rules. New results include 1) a reconstruction of Einstein's incompleteness argument, which concludes that a local, separable, and categorical QM cannot exist, 2) a reinterpretation of (...) Bohr's principle of correspondence, grounded in the principle of permanence, 3) a meaning-variance argument for quantum logic, which follows a line of critical reflections initiated by Weyl, and 4) an argument for semantic indeterminacy leveled against inferentialism about QM, inspired by Carnap's work in the philosophy of classical logic. (shrink)

I argue against inferentialism about logic. First, I argue against an analogy between logic and chess, before considering a more basic objection to stipulating inference rules as a way of establishing the meaning of logical constants. The objectionthe Mushroom Omelette Objectionis that stipulative acts are partly constituted by logical notions, and therefore cannot be used to explain logical thought. I then argue that the same problem also attaches to following existing conventional rules, since either those (...) rules have logical contents, or following those conventional rules is done for logical reasons. Lastly, I compare this argument with other arguments found in Quine’s early work, and consider two attempts to reply to Quine. (shrink)

The view that contradictions cannot be true has been part of accepted philosophical theory since at least the time of Aristotle. In this regard, it is almost unique in the history of philosophy. Only in the last forty years has the view been systematically challenged with the advent of dialetheism. Since Graham Priest introduced dialetheism as a solution to certain self-referential paradoxes, the possibility of true contradictions has been a live issue in the philosophy of logic. Yet, despite the arguments (...) advanced by dialetheists, many logicians and philosophers still hold the opinion that contradictions cannot be true. -/- Rather than advocating the truth of certain contradictions, this thesis offers a different challenge to the classical logician. By showing that it can be philosophically coherent to propose that true contradictions are metaphysically possible, the thesis suggests that the classical logician must do more than she currently has to justify her confidence in the impossibility of true contradictions. Simply fighting off the dialetheist’s putative examples of true contradictions at the actual world isn’t enough to justify the classical logician’s conclusion that true contradictions are impossible. -/- To aid the thesis dialectically, we introduce a new position, absolutism, which hypothesises that it’s metaphysically possible for at least one contradiction to be true, contrasting with the dialetheic hypothesis that some contradictions are true in the actual world. We demonstrate that absolutism can be given a philosophically coherent interpretation, an appropriate logic, and that certain criticisms are completely toothless against absolutism. The challenge put to the classical logician is then: On what logical or philosophical grounds can we rule out the metaphysical possibility of true contradictions? (shrink)

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

Although the cognition is significant in strategic reasoning, its role has been weakly analyzed, because only the average intelligence is usually considered. For example, prisoner's dilemma in game theory, would have different outcomes for persons with different intelligence. I show how various levels of intelligence influence the quality of reasoning, decision, or the probability of psychosis. I explain my original methodology developed for my MA thesis in clinical psychology in 1998, and grant research in 1999, demonstrating the bias of the (...) classic IQ method, and how the intelligence limits thinking. Based on that I defined Personality Model, providing insight into understanding of psychosis (schizophrenia, bi-polar), which has not been explained yet by psychology or psychiatry. In addition, it enables to analyze and assess non-linear problems, utilizable in computer programming, visualization (animation) or other fields including Baduk game. I've already applied some principles in complex information system www.each.co.uk, and video-animations exhibited in London, Germany, Tokyo. I need to mention my experience in chess composition between 1994 and 2000, winning a few international prizes and inventing a special class of fairy rules redefining the mate. The chess composition principles or patterns show the way to organize logical series to higher advanced mechanisms (like calculus), applicable to other fields. One of such principles is a logical aesthetic innovation: new strategy, defined by Italian composers. Finally I show how the simple redefinition of the classic utility concept links economics and psychology to explain irrational / destructive behavior. All presented results (from the research) can be repeated. (shrink)

The article evaluates the Domain Postulate of the Classical Model of Science and the related Aristotelian prohibition rule on kind-crossing as interpretative tools in the history of the development of mathematics into a general science of quantities. Special reference is made to Proclus’ commentary to Euclid’s first book of Elements , to the sixteenth century translations of Euclid’s work into Latin and to the works of Stevin, Wallis, Viète and Descartes. The prohibition rule on kind-crossing formulated by Aristotle in Posterior (...) analytics is used to distinguish between conceptions that share the same name but are substantively different: for example the search for a broader genus including all mathematical objects; the search for a common character of different species of mathematical objects; and the effort to treat magnitudes as numbers. (shrink)

Gaining information can be modelled as a narrowing of epistemic space . Intuitively, becoming informed that such-and-such is the case rules out certain scenarios or would-be possibilities. Chalmers’s account of epistemic space treats it as a space of a priori possibility and so has trouble in dealing with the information which we intuitively feel can be gained from logical inference. I propose a more inclusive notion of epistemic space, based on Priest’s notion of open worlds yet which contains (...) only those epistemic scenarios which are not obviously impossible. Whether something is obvious is not always a determinate matter and so the resulting picture is of an epistemic space with fuzzy boundaries. (shrink)

Cognitive scientists used to deem reasoning either as a higher cognitive process based on the manipulation of abstract rules or as a higher cognitive process that is stochastic rather than involving abstract rules. I maintain that these different perspectives are closely intertwined with a theoretical and methodological endorsement of either cognitivism or connectionism. Cognitivism and connectionism represent two prevailing and opposed paradigms in cognitive science. I aim to extoll the virtues of connectionist models of enthymematic reasoning by following (...) means: via the phenomenon of creative enthymeme, viz. the inference where one cannot even articulate the missing premise, I introduce a connectionist mechanism of pattern recognition as underlying expertise; via Gestalt switch or Gestalt click, I demonstrate how differences in pattern recognition of an expert and a novice can be construed as qualitatively different, and not merely a matter of faster reasoning. (shrink)

The widely discussed "discursive dilemma" shows that majority voting in a group of individuals on logically connected propositions may produce irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of individuals accepting it exceeds a given threshold, where different thresholds may be used for different propositions. After characterizing quota rules, we prove necessary and sufficient conditions on the required thresholds for various collective rationality requirements. We also (...) consider sequential quota rules, which ensure collective rationality by adjudicating propositions sequentially and letting earlier judgments constrain later ones. Sequential rules may be path-dependent and strategically manipulable. We characterize path-independence and prove its essential equivalence to strategy-proofness. Our results shed light on the rationality of simple-, super-, and sub-majoritarian decision-making. (shrink)

Can we design a perfect democratic decision procedure? Condorcet famously observed that majority rule, our paradigmatic democratic procedure, has some desirable properties, but sometimes produces inconsistent outcomes. Revisiting Condorcet’s insights in light of recent work on the aggregation of judgments, I show that there is a conflict between three initially plausible requirements of democracy: “robustness to pluralism”, “basic majoritarianism”, and “collective rationality”. For all but the simplest collective decision problems, no decision procedure meets these three requirements at once; at most (...) two can be met together. This “democratic trilemma” raises the question of which requirement to give up. Since different answers correspond to different views about what matters most in a democracy, the trilemma suggests a map of the “logical space” in which different conceptions of democracy are located. It also sharpens our thinking about other impossibility problems of social choice and how to avoid them, by capturing a core structure many of these problems have in common. More broadly, it raises the idea of “cartography of logical space” in relation to contested political concepts. (shrink)

Modal logic is one of philosophy’s many children. As a mature adult it has moved out of the parental home and is nowadays straying far from its parent. But the ties are still there: philosophy is important to modal logic, modal logic is important for philosophy. Or, at least, this is a thesis we try to defend in this chapter. Limitations of space have ruled out any attempt at writing a survey of all the work going on in our field—a (...) book would be needed for that. Instead, we have tried to select material that is of interest in its own right or exemplifies noteworthy features in interesting ways. Here are some themes that have guided us throughout the writing: • The back-and-forth between philosophy and modal logic. There has been a good deal of give-and-take in the past. Carnap tried to use his modal logic to throw light on old philosophical questions, thereby inspiring others to continue his work and still others to criticise it. He certainly provoked Quine, who in his turn provided—and continues to provide—a healthy challenge to modal logicians. And Kripke’s and David Lewis’s philosophies are connected, in interesting ways, with their modal logic. Analytic philosophy would have been a lot different without modal logic! • The interpretation problem. The problem of providing a certain modal logic with an intuitive interpretation should not be conflated with the problem of providing a formal system with a model-theoretic semantics. An intuitively appealing model-theoretic semantics may be an important step towards solving the interpretation problem, but only a step. One may compare this situation with that in probability theory, where definitions of concepts like ‘outcome space’ and ‘random variable’ are orthogonal to questions about “interpretations” of the concept of probability. • The value of formalisation. Modal logic sets standards of precision, which are a challenge to—and sometimes a model for—philosophy. Classical philosophical questions can be sharpened and seen from a new perspective when formulated in a framework of modal logic. On the other hand, representing old questions in a formal garb has its dangers, such as simplification and distortion. • Why modal logic rather than classical (first or higher order) logic? The idioms of modal logic—today there are many!—seem better to correspond to human ways of thinking than ordinary extensional logic. (Cf. Chomsky’s conjecture that the NP + VP pattern is wired into the human brain.) In his An Essay in Modal Logic (1951) von Wright distinguished between four kinds of modalities: alethic (modes of truth: necessity, possibility and impossibility), epistemic (modes of being known: known to be true, known to be false, undecided), deontic (modes of obligation: obligatory, permitted, forbidden) and existential (modes of existence: universality, existence, emptiness). The existential modalities are not usually counted as modalities, but the other three categories are exemplified in three sections into which this chapter is divided. Section 1 is devoted to alethic modal logic and reviews some main themes at the heart of philosophical modal logic. Sections 2 and 3 deal with topics in epistemic logic and deontic logic, respectively, and are meant to illustrate two different uses that modal logic or indeed any logic can have: it may be applied to already existing (non-logical) theory, or it can be used to develop new theory. (shrink)

This article provides an analysis of Johannes Clauberg’s intentions in writing his Logica vetus et nova (1654, 1658). Announced before his adherence to Cartesianism, his Logica was eventually developed in order to provide Cartesian philosophy with a Scholastic form, embodying a complete methodology for the academic disciplines based on Descartes’ rules and a medicina mentis against philosophical prejudices. However, this was not its only function: thanks to the rules for the interpretation of philosophical texts it encompassed, Clauberg’s Logica (...) was meant to provide a general hermeneutics designed to put an end to the quarrels raised by the dissemination of Cartesianism. Such quarrels, according to Clauberg, were caused by the misinterpretation of Descartes’ texts in Revius’ Methodi cartesianae consideratio theologica (1648) and Statera philosophiae cartesianae (1650) and in Lentulus’ Nova Renati Descartes sapientia (1651), which criticized the apparent lack of a logical theory in Descartes’ philosophy and its supposed inconsistencies. Clauberg answers their criticisms by giving a clear account of Descartes’ logical theory and by undermining the interpretative criteria they assumed, in light of a general theory of error. Polemics over Cartesian philosophy, in this way, favored the development of a comprehensive Cartesian methodology for academic disciplines and of the first hermeneutics for philosophical texts. (shrink)

In this paper, I ask whether we should see different logical systems as appropriate for different domains (or perhaps in different contexts) and whether this would amount to a form of logical pluralism. One, though not the only, route to this type of position, is via pluralism about truth. Given that truth is central to validity, the commitment the typical truth pluralist has to different notions of truth for different domains may suggest differences regarding validity in those different (...) domains. Indeed, as we’ll see, the differences between the proposed multiple notions of truth are often of a type that is clearly significant in relation to logical features, such as whether or not a constructive notion of truth is at issue. I criticise domain-based logical pluralism. Having done so I introduce a context-based framework that operates with a context-relative notion of validity. I show that this context-based framework can be employed by the domain-specific logical pluralist, but that framework also allows for logical pluralism that does not involve several domains. Different contexts may demand rules of classical logic, where others only justify intuitionistic rules, even when the same domain (e.g. mathematics) is at issue. (shrink)

Many philosophers claim that understanding a logical constant (e.g. ‘if, then’) fundamentally consists in having dispositions to infer according to the logical rules (e.g. Modus Ponens) that fix its meaning. This paper argues that such dispositionalist accounts give us the wrong picture of what understanding a logical constant consists in. The objection here is that they give an account of understanding a logical constant which is inconsistent with what seem to be adequate manifestations of such (...) understanding. I then outline an alternative account according to which understanding a logical constant is not to be understood dispositionally, but propositionally. I argue that this account is not inconsistent with intuitively correct manifestations of understanding the logical constants. (shrink)

A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been (...) criticized for using that rule in attempting to show that arithmetic equations are consequences of definitions. -/- A system of deductions is truth-preserving if each of its deductions having true premises has a true conclusion—and consequence-preserving if, for any given set of sentences, each deduction having premises that are consequences of that set has a conclusion that is a consequence of that set. Consequence-preserving amounts to: in each of its deductions the conclusion is a consequence of the premises. The same definitions apply to deduction rules considered as systems of deductions. Every consequence-preserving system is truth-preserving. It is not as well-known that the converse fails: not every truth-preserving system is consequence-preserving. Likewise for rules: not every truth-preserving rule is consequence-preserving. There are many famous examples. In ordinary first-order Peano-Arithmetic, the induction rule yields the conclusion ‘every number x is such that: x is zero or x is a successor’—which is not a consequence of the null set—from two tautological premises, which are consequences of the null set, of course. The arithmetic induction rule is truth-preserving but not consequence-preserving. Truth-preserving rules that are not consequence-preserving are non-logical or extra-logical rules. Such rules are unacceptable to persons espousing traditional truth-and-consequence conceptions of demonstration: a demonstration shows its conclusion is true by showing that its conclusion is a consequence of premises already known to be true. The 1965 Preface in Benson Mates (1972, vii) contains the first occurrence of truth-preservation fallacies in the book. (shrink)