Logical Consequence and Entailment

The richer you are, the less equally rich or richer people. The richest is only one (=unique). Maximization of richness or leisure (=classic utility), maximizes the uniqueness (=improbability) that can be maximized also by: extreme sport, suicide, tattoo, count of views... The richest seem unique as the poorest, but the rich can easily become poor, while the poor can hardly get rich. So the aim of maximization reflects IQ and options. Few options increase irrationality, regardless of IQ. I also present (...) the law of values' equality, Utility of Suicide, motivation to support the better, and overview the economics as such. Presented as PhD thesis at CERGE-EI, 2000, exhibited in Holland Park, W8 6LU, 2013, presented at conferences in Santorini 2016, Daejon 2016, Adelaide 2016. (shrink)

Model of intelligence and new methods to assess IQ. MA thesis in 1998 (Comenius University). Art exhibitions "From Animation" London 2013, "Fading Memory" Weißenohe 2015, TAIF Tokyo 2017. Conferences in Santorini, Daejon 2016, Geneva 2017.

Possibility semantics offers an elegant framework for a semantic analysis of modal logic that does not recruit fully determinate entities such as possible worlds. The present papers considers the application of possibility semantics to the modeling of the indeterminacy of the future. Interesting theoretical problems arise in connection to the addition of object-language determinacy operator. We argue that adding a two-dimensional layer to possibility semantics can help solve these problems. The resulting system assigns to the two-dimensional determinacy operator a well-known (...) logic (coinciding with the logic of universal modalities under global consequence). The paper concludes with some preliminary inroads into the question of how to distinguish two-dimensional possibility semantics from the more established branching framework. (shrink)

In this article, logical concepts are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which the universal and existential quantifiers form a functionally complete set of quantifiers. Neither equality nor cardinal quantifiers belong to the logical constants of a first-order language.

Textbook for students in mathematical logic. Part 1. Total formalization is possible! Formal theories. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom independence. Interpretations, models and completeness theorems. Normal forms. Tableaux method. Resolution method. Herbrand's theorem.

Inductive logic would be the logic of arguments that are not valid, but nevertheless justify belief in something like the way in which valid arguments would. Maybe we could describe it as the logic of “almost valid” arguments. There is a sort of transitivity to valid arguments. Valid arguments can be chained together to form arguments and such arguments are themselves valid. One wants to distinguish the “almost valid” arguments by noting that chains of “almost valid” arguments are weaker than (...) the links that form them. But it is not clear that this is so. I have an apparent counterexample the claim. Though: as is typical in these sorts of situations, it is hard to tell where the problem lies. (shrink)

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...) nothing but equivalence transformations within pure first-order logic (FOL). This procedure involves the application of a calculus for negative normal forms (the NNF-calculus) with A -||- A & A (= &I) as the sole rule that increases the complexity of given FOLDNFs. The described algorithm illustrates how, in the case of Herbrand formulae, decision problems can be solved through a systematic search for proofs that reduce the number of applications of the rule &I to a minimum in the NNF-calculus. In the case of Herbrand formulae, it is even possible to entirely abstain from applying &I. Finally, it is shown how the described procedure can be used within an optimized general search for proofs of contradiction and what kind of questions arise for a &I-minimal proof strategy in the case of a general search for proofs of contradiction. (shrink)

As a response to the semantic and logical paradoxes, theorists often reject some principles of classical logic. However, classical logic is entangled with mathematics, and giving up mathematics is too high a price to pay, even for nonclassical theorists. The so-called recapture theorems come to the rescue. When reasoning with concepts such as truth/class membership/property instantiation, if ones is interested in consequences of the theory that only contain mathematical vocabulary, nothing is lost by reasoning in the nonclassical framework. It is (...) shown that this claim is highly misleading, if not simply false. Under natural assumptions, recapture claims are incorrect. (shrink)

Substructural logics and their application to logical and semantic paradoxes have been extensively studied, but non-reflexive systems have been somewhat neglected. Here, we aim to fill this lacuna, at least in part, by presenting a non-reflexive logic and theory of naive consequence (and truth). We also investigate the semantics and the proof-theory of the system. Finally, we develop a compositional theory of truth (and consequence) in our non-reflexive framework.

Both Tarski and Gödel “prove” that provability can diverge from Truth. When we boil their claim down to its simplest possible essence it is really claiming that valid inference from true premises might not always derive a true consequence. This is obviously impossible.

Minimal Type Theory (MTT) is based on type theory in that it is agnostic about Predicate Logic level and expressly disallows the evaluation of incompatible types. It is called Minimal because it has the fewest possible number of fundamental types, and has all of its syntax expressed entirely as the connections in a directed acyclic graph.

This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). -- .

By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically (...) incorrect. (shrink)

Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to each other (in 2D space) when this expression is formalized using a directed acyclic graph (DAG). This provides substantially greater expressiveness than the 1D space of FOPL syntax. -/- The increase in expressiveness over other formal systems of logic shows the Pathological Self-Reference Error of expressions previously considered to be sentences of formal systems. MTT shows that these expressions were never truth bearers, thus (...) never sentences of any formal logic system. (shrink)

We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory expressions are neither provable nor disprovable (...) only because they are self-contradictory we could define them as unsound instead of defining the formal system as incomplete. (shrink)

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

What are the probabilities that this universe is repeated exactly the same with you in it again? Is God invented by human imagination or is the result of human intuition? The intuition that the same laws/mechanisms (evolution, stability winning probability) that have created something like the human being capable of self-awareness and controlling its surroundings, could create a being capable of controlling all what it exists? Will be the characteristics of the next universes random or tend to something? All these (...) ques-tions that with different shapes (but the same essence) have been asked by human be-ings from the beginning of times will be developed in this paper. (shrink)

Many recent theories of epistemic discourse exploit an informational notion of consequence, i.e. a notion that defines entailment as preservation of support by an information state. This paper investigates how informational consequence fits with probabilistic reasoning. I raise two problems. First, all informational inferences that are not also classical inferences are, intuitively, probabilistically invalid. Second, all these inferences can be exploited, in a systematic way, to generate triviality results. The informational theorist is left with two options, both of them radical: (...) they can either deny that epistemic modal claims have probability at all, or they can move to a nonstandard probability theory. (shrink)

It is commonly accepted that unconditional statements are clearer and less problematic than conditional ones. This article challenges this belief by proposing that all unconditional statements can be reduced to conditional ones since epistemic justification is inherently conditional in nature. The distinction between unconditional and conditional statements is similar to the distinction between assumptions and premises, which is an idealization that results from our attempts to limit epistemic complexity. This has perplexing consequences: (1) since any ordinary statement can be viewed (...) as a disguised conditional, this sets off a chain of epistemic regress that results in a larger conditional that encompasses our entire belief systems; (2) this monster conditional can’t never be justified since it always expands in the process of justification; (3) since there is no such thing as unconditional statements, conditionals themselves become meaningless, which implies that arguments and even entire belief systems become meaningless as well; (4) the only way to avoid these disastrous results is to admit that the meaning of conditionals and, ultimately, of our belief systems is a matter of convention. (shrink)

Different logic systems are motivated by attempts to fix the counter-intuitive instances of classical argumentative forms, e.g., strengthening of the antecedent, contraposition and conditional negation. These counter-examples are regarded as evidence that classical logic should be rejected in favour of a new logic system in which these argumentative forms are considered invalid. It is argued that these logical revisions are ad hoc, because those controversial argumentative forms are implied by other argumentative forms we want to keep. It is impossible to (...) remove an argumentative form from a logical system without getting entangled in an intricate logical web, since these revisions imply the removal of other parts of a system we want to maintain. Consequently, these revisions are incoherent and unwarranted. At the very least, the usual approach in the analysis of counter-examples of argumentative forms must be seriously reconsidered. (shrink)

The prevailing viewpoint concerning conditionals asserts two claims: (1) conditionals featuring non-assertive acts in their consequents, such as commands and promises, cannot plausibly be construed as assertions of material implication; (2) the most promising hypothesis for such sentences is conditional-assertion theory, which defines a conditional as a conditional speech act, i.e., the performance of a speech act given the assumption of the antecedent. This hypothesis carries significant and far-reaching implications, as conditional speech acts are not synonymous with a proposition possessing (...) truth conditions. This paper opposes such a view in two steps. Firstly, it presents a battery of objections against conditional-assertion theory. Secondly, it advances the argument that such examples can indeed be convincingly construed as assertions of material implication. (shrink)

It is usually accepted that deductions are non-informative and monotonic, inductions are informative and nonmonotonic, abductions create hypotheses but are epistemically irrelevant, and both deductions and inductions can’t provide new insights. In this article, I attempt to provide a more cohesive view of the subject with the following hypotheses: (1) the paradigmatic examples of deductions, such as modus ponens and hypothetical syllogism, are not inferential forms, but coherence requirements for inferences; (2) since any reasoner aims to be coherent, any inference (...) must be deductive; (3) a coherent inference is an intuitive process where the premises should be taken as sufficient evidence for the conclusion, which on its turn should be viewed as necessary evidence for the premises in some modal range; (4) inductions, properly understood, are abductions, but there are no abductions beyond the fact that in any inference the conclusion should be regarded as necessary evidence for the premises; (5) monotonicity is not only compatible with the retraction of past inferences given new information, but it is a requirement for it; (6) this explanation of inferences holds true for discovery processes, predictions and trivial inferences. (shrink)

Intensional evidence is any reason to accept a proposition that is not the truth values of the proposition accepted or, if it is a complex proposition, is not the truth values of its propositional contents. Extensional evidence is non-intensional evidence. Someone can accept a complex proposition, but deny its logical consequences when her acceptance is based on intensional evidence, while the logical consequences of the proposition presuppose the acceptance of extensional evidence, e.g., she can refuse the logical consequence of a (...) proposition she accepts because she doesn’t know what are the truth-values of its propositional contents. This tension motivates counterexamples to the negation of conditionals, the propositional analysis of conditionals, hypothetical syllogism, contraposition and or-to-if. It is argued that these counterexamples are non-starters because they rely on a mix of intensionally based premises and extensionally based conclusions. Instead, a genuine counterexample to classical argumentative forms should present circumstances where an intuitively true and extensionally based premise leads to an intuitively false conclusion that is also extensionally based. The other point is that evidentiary concerns about intensionally based beliefs should be constrained by the truth conditions of propositions presented by classical logic, which are nothing more than requirements of coherence in distributions of truth value. It is argued that this restriction also dissolves some known puzzles such as conditional stand-offs, the Adams pair, the opt-out property and the burglar’s puzzle. (shrink)

In relation to inferences, there is a tendency to conflate metaphysical with epistemic modalities. Concerning deductive inferences, necessity is conflated with certainty, but deductive inferences can be just likely based on the available evidence. Non-deductive inferences are defined by their uncertainty, but their epistemic status is insufficient to distinguish them from deductive inferences.

There is almost a consensus among conditional experts that indicative conditionals are not material. Their thought hinges on the idea that if indicative conditionals were material, A → B could be vacuously true when A is false, even if B would be false in a context where A is true. But since this consequence is implausible, the material account is usually regarded as false. It is argued that this point of view is motivated by the grammatical form of conditional sentences (...) and the symbols used to represent their logical form, which misleadingly suggest a one-way inferential direction from A to B. That conditional sentences mislead us into a directionality bias is a phenomenon that is well-documented in the literature about conditional reasoning. It is argued that this directional appearance is deceptive and does not reflect the underlying truth conditions of conditional sentences. This directional bias is responsible for both the unpopularity of the material account of conditionals and some of the main alternative principles and themes in conditional theory, including the Ramsey’s test, the Equation, Adams’ thesis, conditional-assertion and possible world theories. The directional mindset forgets a hard- earned lesson that made classical logic possible in the first place, namely, that grammatical form of sentences can mislead us about its truth conditions. There is a case to be made for a material account of indicative conditionals when we break the domination of words over the human mind. (shrink)

Four intuitions are recurrent and influential in theories about conditionals: the Ramsey’s test, the Adams’ Thesis, the Equation, and the robustness requirement. For simplicity’s sake, I call these intuitions ‘the big four’. My aim is to show that: (1) the big four are interdependent; (2) they express our inferential dispositions to employ a conditional on a modus ponens; (3) the disposition to employ conditionals on a modus ponens doesn’t have the epistemic significance that is usually attributed to it, since the (...) acceptability or truth conditions of a conditional is not necessarily associated with its employability on a modus ponens. (shrink)

There is no strict alignment between induction and fallibility, nor between deduction and certainty. Fallibility in deductive inferences, such as failed mathematical theorems, demonstrates that deduction does not guarantee certainty. Similarly, inductive reasoning, typically seen as weaker and more prone to uncertainty, is not inherently tied to fallibility. In fact, inductive generalizations can sometimes lead to certainty, especially in mathematical contexts. By decoupling induction from fallibility and deduction from certainty, we preserve the distinct nature of each form of reasoning, allowing (...) them to be properly understood without unnecessary constraints. (shrink)

Two definitions of deduction are offered. The first is that deduction is an inference type that is both possibly valid and possibly invalid. No inference can satisfy this definition, because valid inferences are not possibly invalid and invalid inferences are not possibly valid. In the second definition, deduction is understood as an inference that aims for validity. This definition also has unwanted consequences, including the fact that invalid inferences are only deductive when they are thought to be possibly valid. If (...) the only genuine deductions are the valid ones, then our talk about deduction is an indirect and thoughtless way of referring to valid inferences rather than to an inference type. There is simply no deduction to speak off. Only valid inferences. (shrink)

Russell’s role in the controversy about the paradoxes of material implication is usually presented as a tale of how even the greatest minds can fall prey to basic conceptual confusions. Quine accused him of making a silly mistake in Principia Mathematica. He interpreted “if- then” as a version of “implies” and called it material implication. Quine’s accusation is that this decision involved a use-mention fallacy because the antecedent and consequent of “if-then” are used instead of being mentioned as the premise (...) and the conclusion of an implication relation. It was his opinion that the criticisms and alternatives to the material implication presented by C. I. Lewis and others would never be made in the first place if Russell simply called the Philonian construction “material conditional” instead of “material implication”. Quine’s interpretation of the topic became hugely influential if not universally accepted. This paper will present the following criticisms against this interpretation: (1) the notion of material implication does not involve a use-mention fallacy, since the components of “if-then” are mentioned and not used; (2) Quine’s belief that the components of “if-then” are used was motivated by a conditional-assertion view of conditionals that is widely controversial and faces numerous difficulties; (3) if anything, it was Quine who could be accused of fallacious reasoning: he ignored that in the assertion of a conditional is the whole proposition that is asserted and not its constituents; (4) the Philonian construction remains counter-intuitive even if it is called “material conditional”; (5) the Philonian construction is more plausible when it is interpreted as a material implication. (shrink)

The material account of indicative conditionals faces a legion of counterexamples that are the bread and butter in any entry about the subject. For this reason, the material account is widely unpopular among conditional experts. I will argue that this consensus was not built on solid foundations, since these counterexamples are contextual fallacies. They ignore a basic tenet of semantics according to which when evaluating arguments for validity we need to maintain the context constant, otherwise any argumentative form can be (...) rendered invalid. If we maintain the context fixed, the counterexamples to the material account are disarmed. Throughout the paper I also consider the ramifications of this defence, make suggestions to prevent contextual fallacies, and anticipate some possible misunderstandings and objections. (shrink)

There is a profound, but frequently ignored relationship between logical consequence (formal implication) and material implication. The first repeats the patterns of the latter, but with a wider modal reach. It is argued that this kinship between formal and material implication simply means that they express the same kind of implication, but differ in scope. Formal implication is unrestricted material implication. This apparently innocuous observation has some significant corollaries: (1) conditionals are not connectives, but arguments; (2) the traditional examples of (...) valid argumentative forms are metalogical principles that express the properties of logical consequence; (3) formal logic is not a useful guide to detect valid arguments in the real world; (4) it is incoherent to propose alternatives to the material implication while accepting the classical properties of formal implication; (5) some of the counter-examples to classical argumentative forms and known conditional puzzles are unsound. (shrink)

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

Adam Rieger (2013) has carried out a survey of arguments in favour of the material account of indicative conditionals. These arguments involve simple and direct demonstrations of the material account. I extend the survey with new arguments and clarify the logical connections among them. I also show that the main counter-examples against these arguments are not successful either because their premises are just as counter-intuitive as the conclusions, or because they depend on contextual fallacies. The conclusion is that the unpopularity (...) of the material account is unjustified and that a more systematic approach in the analysis of arguments is long overdue in our attempts to understand the nature of conditionals. (shrink)

The material conditional and the suppositional analysis of the indicative conditional are based on different philosophical foundations and they leave important successes of their competitor unexplained. This paper unifies both accounts within a truth-functional, trivalent model of the suppositional analysis. In this model, we observe that the material and the suppositional conditional exhibit the same logical behavior while they have different truth conditions and different probabilities. The result is a unified semantic analysis that closes an important gap in the suppositional (...) story and explains the persistent appeal of the material conditional analysis for philosophers and psychologists of reasoning. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Logical analysis of the applicability of nominals (which are introduced by hybrid logic) in the formal descriptions of the world (within modern knowledge representation and semantics-based systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific [temporal and/or spacial] states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in description logic (DL) and a nominal can be related to each other?’. Based (...) on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, the paper will analyse hybridised fundamental world descriptions. The research will finally reach the idea that we can have a hybrid description logic based on the analysed concepts. (shrink)

This paper is a guide to the main ideas and innovations in Robert Stalnaker's "Indicative Conditionals". The paper is for a volume of essays on twenty-one classics of formal semantics edited by Louise McNally and Zoltàn Gendler Szabò.

Graham Priest has recently proposed a solution to the problem of the One and the Many which involves inconsistent objects and a non-transitive identity relation. We show that his solution entails either that the object everything is identical with the object nothing or that they are mutual parts; depending on whether Priest goes for an extensional or a non-extensional mereology.

This paper introduces a novel theory of vagueness. Its main aim is to show how naïve judgments about tolerance and indeterminacy can be preserved while departing from classical logic only in ways which are independently motivated. -/- The theory makes use of a bilateral approach to acceptance and rejection. Combined with a standard account of validity, this approach gives rise to an entailment relation which is non-transitive. I argue that this is desirable: it is both pre-theoretically plausible and provides a (...) compelling solution to a number of longstanding puzzles. The theory aims to preserve the naïve picture of vagueness. It combines tools from expressivist and dynamic treatments of information in conversation to show how principles which are generally assumed to be in tension are compatible. The resulting logic departs from classical logic in precisely those places we should expect it to. -/- . (shrink)

When Aristotle introduces the perfect moods, he refers back to the dictum de omni et nullo, a semantic condition for universal affirmations and negations. There recently has been renewed interest in the question whether the dictum validates the assertoric syllogistic. I rehearse evidence that Aristotle provides a mereological semantics for universal affirmations and negations, and note that this semantics entails a nonstandard reading of the dictum, under which the dictum, in the presence of a minimal logical apparatus, indeed validates the (...) assertoric syllogistic. I argue that this mereological validation offers advantages over recent discussions in Morison, Malink, Ebert and Vlasits. (shrink)

Compare two conceptions of validity: under an example of a modal conception, an argument is valid just in case it is impossible for the premises to be true and the conclusion false; under an example of a topic-neutral conception, an argument is valid just in case there are no arguments of the same logical form with true premises and a false conclusion. This taxonomy of positions suggests a project in the philosophy of logic: the reductive analysis of the modal conception (...) of logical consequence to the topic-neutral conception. Such a project would dispel the alleged obscurity of the notion of necessity employed in the modal conception in favour of the clarity of an account of logical consequence given in terms of tractable notions of logical form, universal generalization and truth simpliciter. In a series of publications, John Etchemendy has characterized the model-theoretic definition of logical consequence as truth preservation in all models as intended to provide just such an analysis. In this paper, I will argue that Aristotle intends to provide an account of a modal conception of logical consequence in topic-neutral terms and so is engaged in a project comparable to the one described above. That Aristotle would be engaged in this sort of project is controversial. Under the standard reading of the Prior Analytics, Aristotle does not and cannot provide an account of logical consequence. Rather, he must take the validity of the first figure syllogisms (such as the syllogism known by its medieval mnemonic ‘Barbara’: A belongs to all B; B belongs to all C; so A belongs to all C) as obvious and not needing justification; he then establishes the validity of the other syllogisms by showing that they stand in a suitable relation to the first figure syllogisms. I will argue that Aristotle does attempt to provide an account of logical consequence—namely, by appeal to certain mereological theorems. For example, he defends the status of Barbara as a syllogism by appeal to the transitivity of mereological containment. There are, as I will discuss, reasons to doubt the success of this account. But the attempt is not implausible given certain theses Aristotle holds in semantics, mereology and the theory of relations. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

Some philosophers argue that a theory of logical validity should not interpret its own language, because a Russellian argument shows that self-applicability is inconsistent with the ability to capture all the interpretations of its own language. First, I set up a formal system to examine the Russellian argument. I then defend the need for self-applicability. I argue that self-applicability seems to be implied by generality, and that the Russellian argument rests on a test for meaning that is biased against self-applicability. (...) I propose an alternative test which is unproblematic for self-applicability. I conclude that self-applicability can be vindicated and the Russellian argument can be resisted. (shrink)

I argue that logic is unlike science in its methodology, thus rejecting anti-exceptionalism about logic. Logic has a mathematical and a philosophical part. In its mathematical part, the methodology of logic is like that of mathematics, and no need to choose between theories arises in that part. In its philosophical part, the methodology of logic is like that of philosophy. Philosophy and mathematics are both unlike the empirical sciences in their methodology. So logic is unlike the empirical sciences in its (...) methodology. I end by looking at disagreements about the liar paradox as an example. (shrink)

This paper raises some questions about the formalization of sentences containing ‘if’ or similar expressions. In particular, it focuses on three kinds of sentences that resemble conditionals in some respects but exhibit distinctive logical features that deserve separate consideration: whether-or-not sentences, biscuit conditionals, and concessive conditionals. As will be suggested, the examples discussed show in different ways that an adequate formalization of a sentence must take into account the content expressed by the sentence. This upshot is arguably what one should (...) expect on the view that logical form is determined by truth conditions. (shrink)

A general mathematical framework, based on countable partitions of Natural Numbers [1], is presented, that allows to provide a Semantics to propositional languages. It has the particularity of allowing both the valuations and the interpretation Sets for the connectives to discriminate complexity of the formulas. This allows different adequacy criteria to be used to assess formulas associated with the same connective, but that differ in their complexity. The presented method can be adapted potentially infinite number of connectives and truth values, (...) therefore, it can be considered a general framework to provide semantics to several of the known logic systems (eg, LC, L3 LP, FDE). The presented semantics allow to converge to different standard semantics if the separation complexity procedure is annulled. Therefore, it can be understood as a framework that allows greater precision (in complexity terms) with respect to formula satisfaction. Naturally, because of how it is built, it can be incorporated into non-deterministic semantics. The presented procedure also allows generating valuations that grant a different truth value to each formula of propositional language. As a positive side effect, our method allows a constructive proof of the equipotence between N and N^n for all Natural n. (shrink)

What is the connection between valid inference and true conditionals? Many conditional logics require that when A is a logical consequence of B, "if B then A" is true. Taking counterlogical conditionals seriously leads to systems that permit counterexamples to that general rule. However, this leaves those of us who endorse non-trivial accounts of counterpossible conditionals to explain what the connection between conditionals and consequence is. The explanation of the connection also answers a common line of objection to non-trivial counterpossibles, (...) which is based on a transition from valid arguments to the corresponding conditionals. It also contributes to the wider project of illuminating the connections between contexts of utterance, on the one hand, and the truth-conditions of conditionals uttered in those contexts, on the other. (shrink)

The paper is concerned with the rational requirements for suspended judgment, or what suspending judgment about a question rationally commits one to. It shows that two purported rational requirements for suspended judgment cannot both be true at the same time, at least when the entailment relation between questions is understood a certain way. The first one says that one is rationally required to suspend judgment about those questions that are entailed by the questions that one already suspends judgment about. The (...) second one says that one is rationally required to believe the presuppositions of the questions one suspends judgment about. Two plausible solutions to the problem are discussed. One of them explicates the relation of entailment between questions in an alternative manner, and the other one rejects the presupposition requirement. Either way, a closure requirement for suspended judgment can be maintained which is analogous to the closure requirement for belief. Whereas belief is ideally closed under entailment between propositions, suspended judgment is ideally closed under entailment between questions. (shrink)