The paper begins with a more carefully stated version of ontologically neutral (ON) logic, originally introduced in (Hailperin, 1997). A non-infinitistic semantics which includes a definition of potential infinite validity follows. It is shown, without appeal to the actual infinite, that this notion provides a necessary and sufficient condition for provability in ON logic.

Neuroscience has studied deductive reasoning over the last 20 years under the assumption that deductive inferences are not only de jure but also de facto distinct from other forms of inference. The objective of this research is to verify if logically valid deductions leave any cerebral electrical trait that is distinct from the trait left by non-valid deductions. 23 subjects with an average age of 20.35 years were registered with MEG and placed into a two conditions paradigm (100 trials for (...) each condition) which each presented the exact same relational complexity (same variables and content) but had distinct logical complexity. Both conditions show the same electromagnetic components (P3, N4) in the early temporal window (250–525 ms) and P6 in the late temporal window (500–775 ms). The significant activity in both valid and invalid conditions is found in sensors from medial prefrontal regions, probably corresponding to the ACC or to the medial prefrontal cortex. The amplitude and intensity of valid deductions is significantly lower in both temporal windows (p = 0.0003). The reaction time was 54.37% slower in the valid condition. Validity leaves a minimal but measurable hypoactive electrical trait in brain processing. The minor electrical demand is attributable to the recursive and automatable character of valid deductions, suggesting a physical indicator of computational deductive properties. It is hypothesized that all valid deductions are recursive and hypoactive. (shrink)

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

© The Authors 2017. Published by Oxford University Press on behalf of The Analysis Trust. All rights reserved. For Permissions, please email: [email protected] Propositions, Trenton Merricks defends a certain vision of the metaphysics of propositions: propositions exist necessarily and they primitively and essentially represent the world as being a certain way. The book is compact but rich: it is packed with arguments, moves at a fast pace, yet is written with admirable clarity.While I am sympathetic to many of Merrick’s conclusions, (...) I found some of his arguments towards these conclusions lacking. In Section 1, I discuss his claim that arguments constituted by propositions cannot be logically valid. In Section 2, I discuss his argument against singular propositions as having the entities they are about as constituents, and in particular his commitment to necessarily existing singular propositions... (shrink)

What are people who disagree about logic disagreeing about? The paper argues that (in a wide range of cases) they are primarily disagreeing about how to regulate their degrees of belief. An analogy is drawn between beliefs about validity and beliefs about chance: both sorts of belief serve primarily to regulate degrees of belief about other matters, but in both cases the concepts have a kind of objectivity nonetheless.

Alethic pluralism holds that there are many ways of being true. The view has been accused of being unable to do justice to the traditional account of logical validity, understood as necessary truth preservation. In this paper I reformulate the debate in terms of the naturalness of generic truth, and discuss some notable consequences of this more careful reformulation. I show not only that some alleged solutions, like the resort to plural quantification, are ineffective, but also that the (...) problem is not really posed by mixed inferences, as usually thought. Finally, I argue that the traditional account of logical validity does carry a commitment to generic truth, so that a strong version of alethic pluralism can hardly vindicate it. (shrink)

A number of authors have argued that Peano Arithmetic supplemented with a logical validity predicate is inconsistent in much the same manner as is PA supplemented with an unrestricted truth predicate. In this paper I show that, on the contrary, there is no genuine paradox of logical validity—a completely general logical validity predicate can be coherently added to PA, and the resulting system is consistent. In addition, this observation lead to a number of novel, (...) and important, insights into the nature of logical validity itself. (shrink)

What we call the Hilbert‐Bernays (HB) Theorem establishes that for any satisfiable first‐order quantificational schema S, there are expressions of elementary arithmetic that yield a true sentence of arithmetic when they are substituted for the predicate letters in S. Our goals here are, first, to explain and defend W. V. Quine's claim that the HB theorem licenses us to define the first‐order logical validity of a schema in terms of predicate substitution; second, to clarify the theorem by sketching (...) an accessible and illuminating new proof of it; and, third, to explain how Quine's substitutional definition of logical notions can be modified and extended in ways that make it more attractive to contemporary logicians. (shrink)

According to the Bayesian paradigm in the psychology of reasoning, the norms by which everyday human cognition is best evaluated are probabilistic rather than logical in character. Recently, the Bayesian paradigm has been applied to the domain of argumentation, where the fundamental norms are traditionally assumed to be logical. Here, we present a major generalisation of extant Bayesian approaches to argumentation that utilizes a new class of Bayesian learning methods that are better suited to modelling dynamic and conditional (...) inferences than standard Bayesian conditionalization, is able to characterise the special value of logically valid argument schemes in uncertain reasoning contexts, greatly extends the range of inferences and argumentative phenomena that can be adequately described in a Bayesian framework, and undermines some influential theoretical motivations for dual function models of human cognition. We conclude that the probabilistic norms given by the Bayesian approach to rationality are not necessarily at odds with the norms given by classical logic. Rather, the Bayesian theory of argumentation can be seen as justifying and enriching the argumentative norms of classical logic. (shrink)

According to a traditional view, logical validity consists in necessary truth preservation. Such an account has been argued to carry an apparent commitment to a unique property of truth to be preserved from premises to conclusion. Recent discussions, however, have concluded that if the metaphor of truth preservation is carefully unpacked, no need for a unique property is there. All is needed is that certain structural relations among instantiations of truth properties hold. Against this view, we argue that (...) a unique general truth property is indeed required by logical validity. We first show that the unpacking should be correctly understood since it imposes constraints on the concept and the properties of truth. We then demonstrate that, under such constraints, a general property is not imposed by truth preservation but by another feature of validity: its uniformity. Finally, some options that could be attempted to resist this result are discussed, showing that (strong) truth pluralism and deflationism are affected in different ways. (shrink)

A recognizable topological model construction shows that any consistent principles of classical set theory, including the validity of the law of the excluded third, together with a standard class theory, do not suffice to demonstrate the general validity of the law of the excluded third. This result calls into question the classical mathematician's ability to offer solid justifications for the logical principles he or she favors.

The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of Yale University, (...) called the ALL Project (Accelerated Learning of Logic). Following the introduction, the game of VALIDITY is described, first with reference to the propositional calculus, and then in connection with the first-order predicate calculus with identity. Sections in the text are devoted to discussions of the various rules of derivation employed in both calculi. Three appendices follow the main text; these provide a catalogue of sequents and theorems that have been proved for the propositional calculus and for the predicate calculus, and include suggestions for the classroom use of VALIDITY in university-level courses in mathematical logic. (shrink)

Firstly I characterize Simple Partial Logic (SPL) as the generalization and extension of a certain two-valued logic. Based on the characterization I present two definitions of validity in SPL. Finally I show that given my characterization these two definitions are more appropriate than other definitions that have been prevalent, since both have some desirable semantic properties that the others lack.

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

Formalizations in first-order logic are standardly used to represent logical forms of sentences and to show the validity of ordinary-language arguments. Since every sentence admits of a variety of formalizations, a challenge arises: why should one valid formalization suffice to show validity even if there are other, invalid, formalizations? This paper suggests an explanation with reference to criteria of adequacy which ensure that formalizations are related in a hierarchy of more or less specific formalizations. This proposal is (...) then compared with stronger criteria and assumptions, especially the idea that sentences essentially have just one logical form. (shrink)

The language of the propositional calculus is extended by two families of propositional probability operators, inductively applicable to the formulae, and the set of all formulae provable in an arbitrary superintuitionistic propositional logic is extended by the probability measure axioms concerning those probability operators. A logical system obtained in such a way, similar to a kind of polymodal logic, makes possible to express a probability measure of truthfulness of any formula. The paper contains a description of the Kripke-type possible (...) worlds semantics covering the considered logical systems, being followed by the corresponding completeness results. (shrink)

I express my dissatisfaction with the common ways to treat the semantic paradoxes. Not only do they give rise to revenge paradoxes, they ignore the wisdom contained in the ordinary reaction to paradoxes. I instead propose an account that vindicates the ordinary reaction to paradox by putting the blame on us philosophers. It is the wrong conception of what a valid inference is, one that is central to “the ideal of deductive logic” that gives rise to the problem. The solution (...) outlined gives us a new way to accept defeat in light of the paradoxes: the arguments that lead to them are based on valid forms of reasoning, but their conclusions are nonetheless rationally rejected. (shrink)

This is a critical examination of Johnstone's thesis that all valid philosophical arguments are ad hominem. I clarify his notions of valid, philosophical, and ad hominem. I illustrate the thesis with his refutation ofthe claim that only ordinary language is correct. r discuss his three supporting arguments (historical, theoretical, and intermediate). And r criticize the thesis with the objections that if an ad hominem argument is valid, it is really ad rem; that it's unclear how his own theoretical argument can (...) be ad hominem; that if an ad hominem argument is really valid, it would have to be based on the proponent's own assumptions; and that the thesis is not true of philosophical arguments that are constructive rather than critical. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of (...) the predicament: one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

The main idea that we want to defend in this paper is that the question of what a logic is should be addressed differently when structural properties enter the game. In particular, we want to support the idea according to which it is not enough to identify the set of valid inferences to characterize a logic. In other words, we will argue that two logical theories could identify the same set of validities, but not be the same logic.

Besides pure declarative arguments, whose premises and conclusions are declaratives, and pure imperative arguments, whose premises and conclusions are imperatives, there are mixed-premise arguments, whose premises include both imperatives and declaratives, and cross-species arguments, whose premises are declaratives and whose conclusions are imperatives or vice versa. I propose a general definition of argument validity: an argument is valid exactly if, necessarily, every fact that sustains its premises also sustains its conclusion, where a fact sustains an imperative exactly if it (...) favors the satisfaction over the violation proposition of the imperative, and a fact sustains a declarative exactly if, necessarily, the declarative is true if the fact exists. I argue that this definition yields as special cases the standard definition of validity for pure declarative arguments and my previously defended definition of validity for pure imperative arguments, and that it yields intuitively acceptable results for mixed-premise and cross-species arguments. (shrink)

Besides pure declarative arguments, whose premises and conclusions are declaratives (“you sinned shamelessly; so you sinned”), and pure imperative arguments, whose premises and conclusions are imperatives (“repent quickly; so repent”), there are mixed-premise arguments, whose premises include both imperatives and declaratives (“if you sinned, repent; you sinned; so repent”), and cross-species arguments, whose premises are declaratives and whose conclusions are imperatives (“you must repent; so repent”) or vice versa (“repent; so you can repent”). I propose a general definition of argument (...) validity: an argument is valid exactly if, necessarily, every fact that sustains its premises also sustains its conclusion, where a fact sustains an imperative exactly if it favors the satisfaction over the violation of the imperative, and a fact sustains a declarative exactly if, necessarily, the declarative is true if the fact exists. I argue that this definition yields as special cases the standard definition of validity for pure declarative arguments and my previously defended definition of validity for pure imperative arguments, and that it yields intuitively acceptable results for mixed-premise and cross-species arguments. (shrink)

The -logic of Terwijn is a variant of first-order logic with the same syntax in which the models are equipped with probability measures and the quantifier is interpreted as ‘there exists a set A of a measure such that for each,...’. Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational, respectively -complete and -hard, and ii) for, respectively decidable and -complete. The adjective ‘general’ here means ‘uniformly over all languages’. (...) We extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability and validity with respect to finite models in E-logic are, i) for rational, respectively -complete and -complete, and ii) for, respectively decidable and -complete. Although partial results toward the countable case are also achieved, the computability of E-logic over countable models still remains largely unsolved. In addition, most o... (shrink)

Thomas Hofweber takes the semantic paradoxes to motivate a radical reconceptualization of logical validity, rejecting the idea that an inference rule is valid just in case every instance thereof is necessarily truth-preserving. Rather than this “strict validity”, we should identify validity with “generic validity”, where a rule is generically valid just in case its instances are truth preserving, and where this last sentence is a generic, like “Bears are dangerous”. While sympathetic to Hofweber’s view that (...) strict validity should be replaced by something allowing for exceptions, I argue that this should instead be truth-conduciveness, a matter of a large majority of instances being truth-preserving. The fact that inference rules have uncountably many instances, I argue, can be handled by defining truth-conduciveness as relative to finite sets of instances. Moreover, I argue that Hofweber’s position, while seemingly radical, may be less so under closer scrutiny. For the mere claim that classical rules and unrestricted truth rules are generically valid (or truth-conducive) is not in itself controversial. Also, if there is an answer to the question of which of these are also strictly valid, then the claim that generic validity is the central notion in logic is at most an interest-relative matter, since there is then also a fact of the matter as to which inference rules are (not) strictly valid. If no solution operating with strict validity to the paradoxes can be had, however, then the claim that validity should be identified with a weaker notion is better motivated. I argue that it is reasonable, in view of past failures, to conjecture that no ordinary solution will score high enough relative to standard (uncontroversial) desiderata to merit justified belief. Hence, it is unknowable which solution is correct. I further argue that this is best explained by its being metaphysically indeterminate which solution is correct. If this conjecture is true, then we ought instead to think of validity as allowing exceptions, and then take the “true logic” to be one that takes both the classical rules and the truth rules to be valid, i.e., truth-conducive. This logic scores very high on the desiderata on logics, and is therefore preferable to any logic operating with strict validity. (shrink)

The so-called materially valid inferences have come to new prominence through the work of Robert Brandom. This paper introduces a fragment of a logic of concepts that does not reduce concepts to their extensions. Concept logic and ist semantics allow us to represent the conceptual knowledge used in material inferences and thus suggests a way to deal with them.

What makes a valid argument valid? Generally speaking, in a valid argument, if the premisses are true, then the conclusion must necessarily also be true. But on its own, this doesn’t tell us all that much. What is truth? And what is necessity? In what follows, I consider answers to these questions proposed by the fourteenth century logician John Buridan († ca. 1358). My central claim is that Buridan’s logic is downstream from his metaphysics. Accordingly, I treat his metaphysical discussions (...) as the key to his logic. As has been often noted, Buridan’s metaphysics are radically anti-realist about universals, though I think the depth and scope of his anti-realism has at times been papered over. Buridan constructs his logic on an amazingly spartan ontology, and this accomplishment is overdue for reconsideration. To the foregoing questions: truth is a feature of propositions, and of propositions only—not of proposition-like states of affairs, or anything like that. It is a function of the reference or supposition (suppositio) of their terms, which depends on predication in a propositional context. And necessary truth is grounded in causation: a predication is necessary if it cannot be falsified by any power, natural or supernatural, without ii annihilating what its terms stand for. “Socrates is a human”, for instance, can only be falsified by annihilating Socrates, and so it is a necessary truth. -/- These considerations provide an ample theoretical basis for a thorough examination of Buridan’s modal logic. This is what the thesis culminates with. In the final chapter, I set forth some novel and surprising findings, chief of which is this: Buridan’s modal syntax and semantics are nothing like Kripke’s—and indeed are incompatible with them. This has significant implications not only for modal logic and metaphysics, but for how we think about medieval logic and philosophy more generally. -/- Throughout the thesis, I advocate a methodology of emphasising the differences, rather than the similarities, between past and present thought. Buridan is wildly unlike what we’re used to, and we should let him speak for himself. (shrink)

In Kant’s Critique of Pure Reason and the Method of Metaphysics (CUP 2023), I argue that the first Critique is not only a ‘propaedeutic’ to metaphysics, but actually already establishes parts of metaphysics. These parts belong to what Kant calls transcendental philosophy. Additionally, I also provide an account of Kant’s critique of dogmatism and Wolff as its main defender. In this paper, I take up Luigi Filieri’s and Davide Dalla Rosa’s invitation to further develop my characterization of transcendental philosophy and (...) I respond to Michael Walschots’s objections against my interpretation of Kant’s critique of Wolff’s dogmatism. (shrink)

What formulas are tense-logically valid depends on the structure of time, for example on whether it has a beginning. Logicians have investigated what formulas correspond to what physical hypotheses about time. Analogously, we can investigate what formulas of modal logic correspond to what metaphysical hypotheses about necessity. It is widely held that physical hypotheses about time may be contingent. If so, tense-logical validity may be contingent. In contrast, validity in modal logic is typically taken to be non-contingent, (...) as reflected by the general acceptance of the so-called “rule of necessitation.” But as has been argued by various authors in recent years, metaphysical hypotheses may likewise be contingent. If, in particular, hypotheses about the extent of possibility are contingent, we should expect modal-logical validity to be contingent too. Let “contingentism” be the view that everything that is not ruled out by logic is possible. I shall investigate what the right system of modal logic is, if contingentism is true. Given plausible assumptions, the system contains the McKinsey principle, and is thus not even contained in S5. It also contains simple and elegant iteration principles for the contingency operator: something is contingent if and only if it is contingently contingent. (shrink)

The controversy which has raged between those who accept Aristotelian Logic and those who reject it, seems to continue. It is, I believe, advisable to consider the arguments on both sides. Modern Logicians for the most part insist that Aristotelian Logic breaks down, i.e. it is not true for all meanings of the terms. On the other hand there are those who insist on the validity of Aristotelian Logic claiming that those values for which it fails are not permissible (...) values. But there is one who stands almost entirely alone in his position—namely Professor H. B. Smith—who maintains that Aristotelian Logic breaks down because and only because its interpretation into Boolean terms has been accomplished by means of a definition that is not forced upon us and which, since it gives up desirable principles, is to be rejected. (shrink)