Entailment is an interesting sigmatoid: It should mean one thing, but it means another, just for starters. When used in Mathematics, it is usually with the sense of saying that something is definitely true. That would be the use in Classical Logic then. When used in Logic, it became something else. Now it was about how the logical system, which can be any nonclassical one, could be making a proposition become true or false. The major issue we found in (...) 2000, when learning from the own nonclassicists what they do, was that they talk about Nonclassical Logic, therefore a way of thinking that is not Cartesian, yet they stick to the notion of entailment we use in Mathematics, and therefore to the Classical Logic ways. We here discuss exactly this. (shrink)

We here propose a solution to the problem we have raised. Basically, the mathematical notion of entailment seems to be connected to the inferential rules from Classical Logic, so that if we have P: x belongs to the reals, and Q: x+2=5 => x=3, P |= Q. Notwithstanding, we would also have that if P: x belongs to the interval (7,10), and Q: x+2=5 => x=3, P |= Q. The second instance of entailment does not seem to be justifiable if (...) our intuition is consulted: Even though we could say that absurdity implies anything in Classical Logic, entailment should be a concept that belongs to the metalogic, not to the logic of the system, so that we should not be inside of the Classical Logic World by the time we assess things in what regards entailment. As another point, our discussions in Entailment led us to choose the sense has as a consequence for entailment, so that it is not really acceptable that we have, as a consequence, using normal language, of x being inside of the real interval (7,10) that if x+2=5, then x=3. If x is in that interval, x+2 should not be 5, unless we are talking about moduli of vectors. However, when we transfer to Classical Logic, in having the antecedent false, and the consequent false as well, we have that the implication, which some call material, is true. We here discuss this sort of matter in detail, and hope to get to the bottom of the issue, and perhaps to a universal solution. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

The system R, or more precisely the pure implicational fragment R›, is considered by the relevance logicians as the most important. The another central system of relevance logic has been the logic E of entailment that was supposed to capture strict relevant implication. The next system of relevance logic is RM or R-mingle. The question is whether adding mingle axiom to R› yields the pure implicational fragment RM› of the system? As concerns the weak systems there are at least (...) two approaches to the problem. First of all, it is possible to restrict a validity of some theorems. In another approach we can investigate even weaker logics which have no theorems and are characterized only by rules of deducibility. (shrink)

As part of our small contribution in dialogue toward better peace development and reconciliation studies, and following Toffler & Toffler’s War and Antiwar (1993), the present article delves into a realm of logic beyond the traditional confines of negation and the excluded middle principle, exploring the nuances of "Otherness" that transcend classical and Nagatomo logics. Departing from the foundational premises of classical Aristotelian logic systems, this exploration ventures into alternative realms of reasoning, specifically examining Neutrosophic Logic and Klein bottle logic (...) (cf. Smarandache, 2005). The study challenges conventional boundaries and explores the implications of embracing paradoxes and self-reference in logic systems, aiming to redefine approaches to understanding truth and reasoning. The paper investigates how these alternative logics open avenues for philosophical inquiry, redefining entropy, and potentially influencing innovative perspectives in free energy systems. Through this exploration, it seeks to expand the discourse on logic, welcoming a broader spectrum of thought beyond established frameworks; and we also discuss shortly a number of possible implementations including in risk management and also Klein bottle entropy redefinition (Tang et al, 2018). (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

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

The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack indeterminate to (...) star semantics for logics whose many-valued semantics include indeterminate. The equivalence of the many-valued semantics and star semantics is established by way of a soundness and completeness proof. The upshot of the novel semantics in terms of the applied semantics of these logics, and specifically infectiousness, is explored, settling on the idea that infectiousness concerns ineffability. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...) in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

This paper has two aims. First, it sets out an interpretation of the relevant logic E of relevant entailment based on the theory of situated inference. Second, it uses this interpretation, together with Anderson and Belnap’s natural deduc- tion system for E, to generalise E to a range of other systems of strict relevant implication. Routley–Meyer ternary relation semantics for these systems are produced and completeness theorems are proven. -/- .

One innovation in this paper is its identification, analysis, and description of a troubling ambiguity in the word ‘argument’. In one sense ‘argument’ denotes a premise-conclusion argument: a two-part system composed of a set of sentences—the premises—and a single sentence—the conclusion. In another sense it denotes a premise-conclusion-mediation argument—later called an argumentation: a three-part system composed of a set of sentences—the premises—a single sentence—the conclusion—and complex of sentences—the mediation. The latter is often intended to show that the conclusion follows from (...) the premises. The complementarity and interrelation of premise-conclusion arguments and premise-conclusion-mediation arguments resonate throughout the rest of the paper which articulates the conceptual structure found in logic from Aristotle to Tarski. This 1972 paper can be seen as anticipating Corcoran’s signature work: the more widely read 1989 paper, Argumentations and Logic, Argumentation 3, 17–43. MR91b:03006. The 1972 paper was translated into Portuguese. The 1989 paper was translated into Spanish, Portuguese, and Persian. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists (...) of linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

What is the rational response when confronted with a set of propositions each of which we have some reason to accept, and yet which taken together form an inconsistent class? This was, in a nutshell, the problem addressed by the Jaina logicians of classical India, and the solution they gave is, I think, of great interest, both for what it tells us about the relationship between rationality and consistency, and for what we can learn about the logical basis of (...) philosophical pluralism. The Jainas claim that we can continue to reason in spite of the presence of inconsistencies, and indeed construct a many-valued logical system tailored to the purpose. My aim in this paper is to offer a new interpretation of that system and to try to draw out some of its philosophical implications. (shrink)

We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justi cations and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic as a logic of assertions and conjectures: looking at (...) the S4 modal translation, we give a de nition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous work [7, 10]. A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.Work on linear co-intuitionism is then recalled, a linear calculus of co-intuitionistic coroutines is de ned and a probabilistic interpretation of linear co-intuitionism is given as in [9]. Also we remark that by extending the language of intuitionistic logic we can express the notion of expectation, an assertion that in all situations the truth of p is possible and that in a logic of expectations the law of double negation holds. Similarly, extending co-intuitionistic logic, we can express the notion of conjecture that p, de ned as a hypothesis that in some situation the truth of p is epistemically necessary. (shrink)

This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas in terms of (...) low-level fundamental concepts in statistical mechanics, thus providing a deeper understanding of these ideas than their standard formulations given in the high-level terms of thermodynamics and cognitive science. Since Landauer’s principle is pivotal in the attempts to derive the universal validity of the second law of thermodynamics in statistical mechanics, our result entails that the multiple-computations theorem has crucial implications with respect to the second law. Finally, our analysis contributes to the understanding of notions, such as “logical irreversibility,” “entropy increase,” “implementing a computation,” in terms of fundamental physics, and to resolving open questions in the literature of both fields, such as: what could it possibly mean that a certain physical process implements a certain computation. (shrink)

An exact truthmaker for A is a state which, as well as guaranteeing A’s truth, is wholly relevant to it. States with parts irrelevant to whether A is true do not count as exact truthmakers for A. Giving semantics in this way produces a very unusual consequence relation, on which conjunctions do not entail their conjuncts. This feature makes the resulting logic highly unusual. In this paper, we set out formal semantics for exact truthmaking and characterise the resulting notion of (...) entailment, showing that it is compact and decidable. We then investigate the effect of various restrictions on the semantics. We also formulate a sequent-style proof system for exact entailment and give soundness and completeness results. (shrink)

In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order classical logic with disjunctive syllogism. It can (...) be shown that SPCD is conservative extension to SCD. Then, the normalization theorem and the consistency of SPCD are given. (shrink)

In previous work, I introduced a complete axiomatization of classical non-tautologies based essentially on Łukasiewicz’s rejection method. The present paper provides a new, Hilbert-type axiomatization (along with related systems to axiomatize classical contradictions, non-contradictions, contingencies and non-contingencies respectively). This new system is mathematically less elegant, but the format of the inferential rules and the structure of the completeness proof possess some intrinsic interest and suggests instructive comparisons with the logic of tautologies.

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach (...) to these truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate. (shrink)

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

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)

Foundations of Relational Realism presents an intuitive interpretation of quantum mechanics, based on a revised decoherent histories interpretation, structured within a category theoretic topological formalism. -/- If there is a central conceptual framework that has reliably borne the weight of modern physics as it ascends into the twenty-first century, it is the framework of quantum mechanics. Because of its enduring stability in experimental application, physics has today reached heights that not only inspire wonder, but arguably exceed the limits of intuitive (...) vision, if not intuitive comprehension. For many physicists and philosophers, however, the currently fashionable tendency toward exotic interpretation of the theoretical formalism is recognized not as a mark of ascent for the tower of physics, but rather an indicator of sway—one that must be dampened rather than encouraged if practical progress is to continue. -/- In this unique two-part volume, designed to be comprehensible to both specialists and non-specialists, the authors chart out a pathway forward by identifying the central deficiency in most interpretations of quantum mechanics: That in its conventional, metrical depiction of extension, inherited from the Enlightenment, objects are characterized as fundamental to relations—i.e., such that relations presuppose objects but objects do not presuppose relations. The authors, by contrast, argue that quantum mechanics exemplifies the fact that physical extensiveness is fundamentally topological rather than metrical, with its proper logico-mathematical framework being category theoretic rather than set theoretic. -/- By this thesis, extensiveness fundamentally entails not only relations of objects, but also relations of relations. Thus, the fundamental quanta of quantum physics are properly defined as units of logico-physical relation rather than merely units of physical relata as is the current convention. Objects are always understood as relata, and likewise relations are always understood objectively. In this way, objects and relations are coherently defined as mutually implicative. The conventional notion of a history as “a story about fundamental objects” is thereby reversed, such that the classical “objects” become the story by which we understand physical systems that are fundamentally histories of quantum events. -/- These are just a few of the novel critical claims explored in this volume—claims whose exemplification in quantum mechanics will, the authors argue, serve more broadly as foundational principles for the philosophy of nature as it evolves through the twenty-first century and beyond. (shrink)

Recently, it has been proposed to understand a logic as containing not only a validity canon for inferences but also a validity canon for metainferences of any finite level. Then, it has been shown that it is possible to construct infinite hierarchies of "increasingly classical" logics—that is, logics that are classical at the level of inferences and of increasingly higher metainferences—all of which admit a transparent truth predicate. In this paper, we extend this line of investigation by taking a somehow (...) different route. We explore logics that are different from classical logic at the level of inferences, but recover some important aspects of classical logic at every metainferential level. We dub such systems meta-classical non-classical logics. We argue that the systems presented deserve to be regarded as logics in their own right and, moreover, are potentially useful for the non-classical logician. (shrink)

Connexive logics are based on two ideas: that no statement entails or is entailed by its own negation (this is Aristotle’s thesis) and that no statement entails both something and the negation of this very thing (this is Boethius' thesis). Usually, connexive logics are contra-classical. In this note, I introduce a reading of the connexive theses that makes them compatible with classical logic. According to this reading, the theses in question do not talk about validity alone; rather, they talk in (...) part about (a property related to) the soundness of arguments. (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages (...) containing the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

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

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

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally (...) two types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a truth value and (...) the exclusion of the opposite truth value describe the same situation.). (shrink)

In the Remark to the final paragraph of the Chapter on “existence” (Dasein) in the Logic of the Encyclopedia of the Philosophical Sciences in Basic Outline (1830) Hegel states that the “ideality of the finite is the chief proposition of philosophy” and that “every true philosophy is for that reason idealism” (Enz § 95A). In turn, at the end of the Chapter on “existence” in the Science of Logic (1832) Hegel claims, further, that “every philosophy is essentially idealism or at (...) least has idealism for its principle, and the question then is only how far this principle is carried out” (GW 21.142). Along this line, Hegel conceives of absolute idealism not only as the result of the history of philosophy, but also as the philosophical system that reveals the essence of the philosophical systems before idealism, that is to say, as the philosophy that reveals, by developing it and formulating it adequately, what the precedent philosophies, mostly unknowingly, tried to develop and formulate, namely a general theory about reality based on the principle of the unity of being and thought. According to Hegel, every particular philosophy throughout history exposed in a successive, partial and complementary way the process of identification of being and thought; inasmuch as the system of absolute idealism assumes the latently idealist theses present in former philosophies, it makes those theses explicit and exposes the process of the identification of being and thought as its own internal development. Thus, absolute idealism is for Hegel the philosophy that exposes and shows what philosophy is actually about. The purpose of this essay is to render explicit the metaphilosophical implications of Hegel´s conception of absolute idealism as the “true philosophy” (wahre Philosophie, wahrhafte Philosophie). (shrink)

We have now mapped the set of analogies Ai,j to conceptual and mechanical meanings. This allows us to recognize how the Group Algebraic System G decomposes into five smaller subsystems, each of which relate to well-known symbolic systems. Furthermore, by recognizing the algorithmic transformations between these subsystems, we can apply each representing a single component of the Group Algebraic System G, or model how algorithms are used in mathematics, by mapping its meaning onto the corresponding transformation steps between the subsystems. (...) Thus, we have transformed a Group Algebraic System G into five simpler subsystems (namely, symbolic analogic, lateral algebraic, calculus of infinity tensors, perturbations in waves, and algorithmic formation of symbols), each of which may also be represented algorithmically. This mapping process serves as a the basis for studying the algebraic machinery used in mathematics and logic to manipulate symbols, such as the classical logical systems or algebraic systems, using algorithms. (shrink)

This short paper has two loosely connected parts. In the first part, I discuss the difference between classical and intuitionist logic in relation to different the role of hypotheses play in each logic. Harmony is normally understood as a relation between two ways of manipulating formulas in systems of natural deduction: their introduction and elimination. I argue, however, that there is at least a third way of manipulating formulas, namely the discharge of assumption, and that the difference between classical and (...) intuitionist logic can be characterised as a difference of the conditions under which discharge is allowed. Harmony, as ordinarily understood, has nothing to say about discharge. This raises the question whether the notion of harmony can be suitably extended. This requires there to be a suitable fourth way of manipulating formulas that discharge can stand in harmony to. The question is whether there is such a notion: what might it be that stands to discharge of formulas as introduction stands to elimination? One that immediately comes to mind is the making of assumptions. I leave it as an open question for further research whether the notion of harmony can be fruitfully extended in the way suggested here. In the second part, I discuss bilateralism, which proposes a wholesale revision of what it is that is assumed and manipulated by rules of inference in deductions: rules apply to speech acts – assertions and denials – rather than propositions. I point out two problems for bilateralism. First, bilaterlists cannot, contrary to what they claim to be able to do, draw a distinction between the truth and assertibility of a proposition. Secondly, it is not clear what it means to assume an expression such as '+ A' that is supposed to stand for an assertion. Worse than that, it is plausible that making an assumption is a particular speech act, as argued by Dummett (Frege: Philosophy of Language, p.309ff). Bilaterlists accept that speech acts cannot be embedded in other speech acts. But then it is meaningless to assume + A or − A. (shrink)

In this paper, we make distinctions between Classical Logic (where the propositions are 100% true, or 100 false) and the Neutrosophic Logic (where one deals with partially true, partially indeterminate and partially false propositions) in order to respond to K. Georgiev’s criticism [1]. We recall that if an axiom is true in a classical logic system, it is not necessarily that the axiom be valid in a modern (fuzzy, intuitionistic fuzzy, neutrosophic etc.) logic system.

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

The thesis that the two-valued system of classical logic is insufficient to explanation the various intermediate situations in the entity, has led to the development of many-valued and fuzzy logic systems. These systems suggest that this limitation is incorrect. They oppose the law of excluded middle (tertium non datur) which is one of the basic principles of classical logic, and even principle of non-contradiction and argue that is not an obstacle for things both to exist and to not exist at (...) the same time. However, contrary to these claims, there is no inadequacy in the two-valued system of classical logic in explanation the intermediate situations in existence. The law of exclusion and the intermediate situations in the external world are separate things. The law of excluded middle has been inevitably accepted by other logic systems which are considered to reject this principle. The many-valued and the fuzzy logic systems do not transcend the classical logic. Misconceptions from incomplete information and incomplete research are effective in these criticisms. In addition, it is also effective to move the discussion about the intellectual conception (tasawwur) into the field of judgmental assent (tasdiq) and confusion of the mawhum (imaginable) with the ma‘kûl (intellegible). (shrink)

This paper presents two systems of natural deduction for the rejection of non-tautologies of classical propositional logic. The first system is sound and complete with respect to the body of all non-tautologies, the second system is sound and complete with respect to the body of all contradictions. The second system is a subsystem of the first. Starting with Jan Łukasiewicz's work, we describe the historical development of theories of rejection for classical propositional logic. Subsequently, we present the two systems of (...) natural deduction and prove them to be sound and complete. We conclude with a ‘Theorem of Inversion’. (shrink)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in (...) a clear sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence (...) according to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

The purpose of this paper is to provide a new system of logic for existence and essence, in which the traditional distinctions between essential and accidental properties, abstract and concrete objects, and actually existent and possibly existent objects are described and related in a suitable way. In order to accomplish this task, a primitive relation of essential identity between different objects is introduced and connected to a first order existence property and a first order abstractness property. The basic idea is (...) that possibly existent objects are completely determinate and that essentially identical objects are just different individuations of the same individual essence. Accordingly, essential properties are defined as properties that are invariant with respect to this kind of identity, while abstract objects are determined by being characterized by essential properties only. Once such ideas are implemented, a number of classical intuitions about objects, their essence, and their way of existence can be consistently interpreted. (shrink)

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

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical interpretation of the (...) connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

This paper shows how to conservatively extend classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth—involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is nontransitive. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system allows for Cut—elimination, but (...) the other does not.). (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents (...) the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

The main objective o f this descriptive paper is to present the general notion of translation between logical systems as studied by the GTAL research group, as well as its main results, questions, problems and indagations. Logical systems here are defined in the most general sense, as sets endowed with consequence relations; translations between logical systems are characterized as maps which preserve consequence relations (that is, as continuous functions between those sets). In this sense, logics together with (...) translations form a bicomplete category of which topological spaces with topological continuous functions constitute a full subcategory. We also describe other uses of translations in providing new semantics for non-classical logics and in investigating duality between them. An important subclass of translations, the conservative translations, which strongly preserve consequence relations, is introduced and studied. Some specific new examples of translations involving modal logics, many-valued logics, para- consistent logics, intuitionistic and classical logics are also described. (shrink)

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is (...) to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. (shrink)

In this paper we prove the completeness of three logical systems I LI, IL2 and IL3. IL1 deals solely with identities {a = b), and its deductions are the direct deductions constructed with the three traditional rules: (T) from a = b and b = c infer a = c, (S) from a = b infer b = a and (A) infer a = a(from anything). IL2 deals solely with identities and inidentities {a ± b) and its deductions include (...) both the direct and the indirect deductions constructed with the three traditional rules. IL3 is a hybrid of IL1 and IL2: its deductions are all direct as in IL1 but it deals with identities and inidentities as in IL2. IL1 and IL2 have a high degree of naturalness. Although the hybrid system IL3 was constructed as an artifact useful in the mathematical study of IL1 and IL2, it nevertheless has some intrinsically interesting aspects. The main motivation for describing and studying such simple systems is pedagogical. In teaching beginning logic one would like to present a system of logic which has the following properties. First, it exemplifies the main ideas of logic: implication, deduction, non-implication, counterargument(or countermodel), logical truth, self-contradiction, consistency,satisfiability, etc. Second, it exemplifies the usual general metaprinciples of logic: contraposition and transitivity of implication, cut laws, completeness,soundness, etc. Third, it is simple enough to be thoroughly grasped by beginners. Fourth, it is obvious enough so that its rules do not appear to be arbitrary or purely conventional. Fifth, it does not invite confusions which must be unlearned later. Sixth, it involves a minimum of presuppositions which are no longer accepted in mainstream contemporary logic. (shrink)

This study concerns logical systems considered as theories. By searching for the problems which the traditionally given systems may reasonably be intended to solve, we clarify the rationales for the adequacy criteria commonly applied to logical systems. From this point of view there appear to be three basic types of logical systems: those concerned with logical truth; those concerned with logical truth and with logical consequence; and those concerned with deduction per se as well (...) as with logical truth and logical consequence. Adequacy criteria for systems of the first two types include: effectiveness, soundness, completeness, Post completeness, "strong soundness" and strong completeness. Consideration of a logical system as a theory of deduction leads us to attempt to formulate two adequacy criteria for systems of proofs. The first deals with the concept of rigor or "gaplessness" in proofs. The second is a completeness condition for a system of proofs. An historical note at the end of the paper suggests a remarkable parallel between the above hierarchy of systems and the actual historical development of this area of logic. (shrink)

Logic is loosely regarded as a key factor that drives our decisions. However, logic is actually separated into different systems, such as intuitionistic logic and classical logic. These systems can be explained by different theories, such as logical monism and logical pluralism. This paper aims to challenge logical monism, which posits that only a single logical system adheres to the principles of validity. It explains this on the basis of different systems held as equally strong under (...) their ability to establish definitive conclusions, and adhere to systems of validity relative to each system. (shrink)

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics that (...) are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)