Logical Consequence and Entailment

An argument is usually said to be valid iff it is truth-preserving—iff it cannot be that all its premises are true and its conclusion false. But imperatives (it is normally thought) are not truth-apt. They are not in the business of saying how the world is, and therefore cannot either succeed or fail in doing so. To solve this problem, we need to find a new criterion of validity, and I aim to propose such a criterion.

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.

I consider the application of possibility semantics to the modeling of the indeterminacy of the future. I argue that interesting problems arise in connection to the addition of object-language determinacy operator. I show that adding a two-dimensional layer to possibility semantics can help solve these problems.

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)

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.

David Miller claims that every valid deductive argument begs the question. Other philosophers and logicians have made similar claims. I show that the claim is false. Its appeal depends on the existence of logical terminology, particularly concerning what a proposition 'contains' or its 'logical content,' that is best understood as metaphoric and that, given its aptness to mislead, would be better eschewed. I show how the terminology appears to derive from early modern theories of the nature of mind, ideas and (...) reasoning that have since been rejected. (shrink)

David Miller propounds a theory of objective knowledge from which he mistakenly derives some consequences about question-begging and persuasion that appear to be false. He makes a further claim about persuasion that also seems false. I argue that Miller’s account of objective knowledge is explanatorily weak unless supplemented with an account of subjective knowledge and that the latter enables us to extricate Miller’s theory from the falsehoods he associates with it.

David Miller argues that there are no good reasons, either sufficient or insufficient. I show that most of his arguments are invalid or unsound. Several of his arguments depend upon the false claim that every deductively valid argument is circular. I accept one of Miller's arguments for the conclusion that there are no good reasons which are less-than-sufficient. I accept one of his arguments to the conclusion that there are no probative sufficient reasons. But I explain how there are epistemic (...) sufficient reasons which are relative to the game of science and how their existence is consistent with Miller's main contentions while avoiding Miller's apparently anarchic account of our knowledge. (shrink)

I give an account of proof terms for derivations in a sequent calculus for classical propositional logic. The term for a derivation δ of a sequent Σ≻Δ encodes how the premises Σ and conclusions Δ are related in δ. This encoding is many–to–one in the sense that different derivations can have the same proof term, since different derivations may be different ways of representing the same underlying connection between premises and conclusions. However, not all proof terms for a sequent Σ≻Δ (...) are the same. There may be different ways to connect those premises and conclusions. -/- Proof terms can be simplified in a process corresponding to the elimination of cut inferences in sequent derivations. However, unlike cut elimination in the sequent calculus, each proof term has a unique normal form (from which all cuts have been eliminated) and it is straightforward to show that term reduction is strongly normalising—every reduction process terminates in that unique normal form. Further- more, proof terms are invariants for sequent derivations in a strong sense—two derivations δ1 and δ2 have the same proof term if and only if some permutation of derivation steps sends δ1 to δ2 (given a relatively natural class of permutations of derivations in the sequent calculus). Since not every derivation of a sequent can be permuted into every other derivation of that sequent, proof terms provide a non-trivial account of the identity of proofs, independent of the syntactic representation of those proofs. (shrink)

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)

The paper begins with a conceptual discussion of Michael Dummett's proof-theoretic justification of deduction or proof-theoretic semantics, which is based on what we might call Gentzen's thesis: 'the introductions constitute, so to speak, the "definitions" of the symbols concerned, and the eliminations are in the end only consequences thereof, which could be expressed thus: In the elimination of a symbol, the formula in question, whose outer symbol it concerns, may only "be used as that which it means on the basis (...) of the introduction of this symbol".' The intuitive philosophical content of Dummett's notions of harmony and stability is that harmony obtains if the grounds for asserting a proposition match the consequences of accepting it, and stability obtains if the converse also holds. Rules of inference define the meanings of a logical constant they govern if and only if they are stable. Gentzen observed that 'it should be possible to establish on the basis of certain requirements that the elimination rules are functions of the corresponding introduction rules.' One of the objectives of this paper is to specify such a function: I will specify a process by which it is possible to determine the elimination rules of logical constants from their introduction rules, and conversely, to determine the introduction rules from the elimination rules. I'll give the general forms of rules of inference and generalised reduction procedures for the normalisation of deduction. I'll give a formally precise characterisations of harmony and stability and show that deductions in logics that contain only constants governed by stable rules always normalise. (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.

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.

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.

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). -- .

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)

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)

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.

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)

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)

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)

The conventional wisdom about conditionals claims that (1) conditionals that have non-assertive acts in their consequents, such as commands and promises, cannot be plausibly interpreted as assertions of material implication; (2) the most promising hypothesis about those sentences is conditional-assertion theory, which explains a conditional as a conditional speech act, i.e., a performance of a speech act given the assumption of the antecedent. This hypothesis has far-reaching and revisionist consequences, because conditional speech acts are not synonymous with a proposition with (...) truth conditions. This paper argues against this view in two steps. First, it presents a battery of objections against conditional-assertion theory. Second, it argues that those examples can be convincingly interpreted as assertions of material implication. (shrink)

It is usually accepted that unconditional statements are clearer and less problematic than conditional ones. This article goes against this popular belief by advancing the contrarian hypothesis that all unconditional statements can be reduced to conditional ones due to the way our assumptions support our assertions. In fact, considering the coherentist process by which most of our different beliefs mutually support themselves, the only genuine example of unconditional statements are cases of self-justified beliefs, but these examples are controversial and few (...) and far between. The distinction between unconditional and conditional statements is similar to the distinction between assumptions and premises in that is a largely conventional idealisation that results from our attempts to limit epistemic complexity. (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)

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 a 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 a necessary evidence for the premises; (5) motonocity 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)

There is a profound, but frequently ignored relationship between the classical notion of 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 variety 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) the counter-examples to classical argumentative forms and conditional puzzles are unsound. (shrink)

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)

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)

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 of 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 on 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)

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 coherence requirements in distributions of truth value. It is argued that this restriction also dissolves some known puzzles such as conditional stand-offs, Adams pair, the opt-out property, and the burglar’s puzzle. (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)

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)

In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not derived’ according (...) to the content of the sequence. We show that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework. The outcome is therefore a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems. (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)

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 infinite 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 infinite 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 infinite rules of inference in their reasoning. (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 contributes to the calculization of evocation and erotetic implication as defined by Inferential Erotetic Logic (IEL). There is a straightforward approach to calculizing (propositional) erotetic implication which cannot be applied to evocation. First-order evocation is proven to be uncalculizable, i.e. there is no proof system, say FOE, such that for all X, Q: X evokes Q iff there is an FOE-proof for the evocation of Q by X. These results suggest a critique of the represented approaches to calculizing (...) IEL. This critique is expanded into a programmatic reconsideration of the IEL-definitions of evocation and erotetic implication. From a different point of view these definitions should be seen as desiderata that may or may not play the role of a point of orientation when setting up "rules of asking". (shrink)

Ian Rumfitt (2000) developed a bilateralist account of logic in which the meaning of the connectives is given by conditions on asserted and rejected sentences. An additional set of inference rules, the coordination principles, determines the interaction of assertion and rejection. Fernando Ferreira (2008) found this account defective, as Rumfitt must state the coordination principles for arbitrary complex sentences. Rumfitt (2008) has a reply, but we argue that the problem runs deeper than he acknowledges and is in fact related to (...) the challenge of establishing proof-theoretic harmony. We motivate a distinctively bilateral criterion for harmony and show how the bilateralist can meet it. This also resolves Ferreira's complaint. (shrink)

Several authors have recently studied Aristotelian diagrams for various metatheoretical notions from logic, such as tautology, satisfiability, and the Aristotelian relations themselves. However, all these metalogical Aristotelian diagrams focus on the semantic perspective on logical consequence, thus ignoring the complementary, and equally important, syntactic perspective. In this paper, I propose an explanation for this discrepancy, by arguing that the metalogical square of opposition for semantic consequence exhibits a natural analogy to the well-known square of opposition for the categorical statements from (...) syllogistics, but that this analogy breaks down once we move from semantic to syntactic consequence. I then show that despite this difficulty, one can indeed construct metalogical Aristotelian diagrams from a syntactic perspective, which have their own, equally elegant characterization in terms of the categorical statements. Finally, I construct several metalogical Aristotelian diagrams that incorporate both semantic and syntactic consequence, and study how they are influenced by the underlying logical system’s soundness and/or completeness. All of this provides further support for the methodological/heuristic perspective on Aristotelian diagrams, which holds that the main use of these diagrams lies in facilitating analogies and comparisons between prima facie unrelated domains of investigation. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and also a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

As the final component of a chain of reasoning intended to take us all the way to logical nihilism, Russell (2018) presents the atomic sentence ‘prem’ which is supposed to be true when featuring as premise in an argument and false when featuring as conclusion in an argument. Such a sentence requires a non-reflexive logic and an endnote by Russell (2018) could easily leave the reader with the impression that going non-reflexive suffices for logical nihilism. This paper shows how one (...) can obtain non-reflexive logics in which ‘prem’ behaves as stipulated by Russell (2018) but which nonetheless has valid inferences supporting uniform substitution of any formula for propositional variables such as modus tollens and modus ponens. (shrink)

According to a standard story, part of what we have in mind when we say that an argument is valid is that it is necessarily truth preserving: if the premises are true, the conclusion must also be true. But—the story continues—that’s not enough, since ‘Roses are red, therefore roses are coloured’ for example, while it may be necessarily truth-preserving, is not so in virtue of form. Thus we arrive at a standard contemporary characterisation of validity: an argument is valid when (...) it is NTP in virtue of form. Here I argue that we can and should drop the N; the resulting account is simpler, less problematic, and performs just as well with examples. (shrink)

Inquisitive logic is a research program seeking to expand the purview of logic beyond declarative sentences to include the logic of questions. To this end, inquisitive propositional logic extends classical propositional logic for declarative sentences with principles governing a new binary connective of inquisitive disjunction, which allows the formation of questions. Recently inquisitive logicians have considered what happens if the logic of declarative sentences is assumed to be intuitionistic rather than classical. In short, what should inquisitive logic be on an (...) intuitionistic base? In this paper, we provide an answer to this question from the perspective of nuclear semantics, an approach to classical and intuitionistic semantics pursued in our previous work. In particular, we show how Beth semantics for intuitionistic logic naturally extends to a semantics for inquisitive intuitionistic logic. In addition, we show how an explicit view of inquisitive intuitionistic logic comes via a translation into propositional lax logic, whose completeness we prove with respect to Beth semantics. (shrink)