Results for 'propositional calculus'

1000+ found
Order:
  1. Axiomatic Investigations of the Propositional Calculus of Principia Mathematica.Paul Bernays - 2012 - In Bernays Paul (ed.), Universal Logic: An Anthology. pp. 43-58.
    Download  
     
    Export citation  
     
    Bookmark  
  2.  51
    Some notes on the Aristotelian doctrine of opposition and the propositional calculus.Gerardo Ó Matía Cubillo - 2023 - Disputatio. Philosophical Research Bulletin 12 (26):53-70.
    We develop some of Williamson’s ideas regarding how propositional calculus aids in comprehending Aristotelian logic. Specifically, we enhance the utilisation of truth tables to examine the structure of opposition diagrams. Using ‘conditioned truth tables’, we establish logical dependency relationships between the truth values of different propositions. This approach proves effective in interpreting various texts of the Organon concerning the doctrine of opposition.
    Download  
     
    Export citation  
     
    Bookmark  
  3. Approximating Propositional Calculi by Finite-valued Logics.Matthias Baaz & Richard Zach - 1994 - In Baaz Matthias & Zach Richard (eds.), 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. IEEE Press. pp. 257–263.
    The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. A Theory of Structured Propositions.Andrew Bacon - 2023 - Philosophical Review 132 (2):173-238.
    This paper argues that the theory of structured propositions is not undermined by the Russell-Myhill paradox. I develop a theory of structured propositions in which the Russell-Myhill paradox doesn't arise: the theory does not involve ramification or compromises to the underlying logic, but rather rejects common assumptions, encoded in the notation of the $\lambda$-calculus, about what properties and relations can be built. I argue that the structuralist had independent reasons to reject these underlying assumptions. The theory is given both (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  5. A Gentzen Calculus for Nothing but the Truth.Stefan Wintein & Reinhard Muskens - 2016 - Journal of Philosophical Logic 45 (4):451-465.
    In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  6. A Nonmonotonic Sequent Calculus for Inferentialist Expressivists.Ulf Hlobil - 2016 - In Pavel Arazim & Michal Dančák (eds.), The Logica Yearbook 2015. College Publications. pp. 87-105.
    I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  7. Russell's 1903 - 1905 Anticipation of the Lambda Calculus.Kevin C. Klement - 2003 - History and Philosophy of Logic 24 (1):15-37.
    It is well known that the circumflex notation used by Russell and Whitehead to form complex function names in Principia Mathematica played a role in inspiring Alonzo Church's “lambda calculus” for functional logic developed in the 1920s and 1930s. Interestingly, earlier unpublished manuscripts written by Russell between 1903–1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the lambda calculus. Russell also anticipated Schönfinkel's combinatory logic approach of treating multiargument functions as functions having other functions (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  8. Strong normalization of a symmetric lambda calculus for second-order classical logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.
    We extend Barbanera and Berardi's symmetric lambda calculus [2] to second-order classical propositional logic and prove its strong normalization.
    Download  
     
    Export citation  
     
    Bookmark  
  9. Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. VALIDITY: A Learning Game Approach to Mathematical Logic.Steven James Bartlett - 1973 - Hartford, CT: Lebon Press. Edited by E. J. Lemmon.
    The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  11. On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.
    By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. On the Mutual Definability of the Notions of Entailment, Rejection, and Inconsistency.Urszula Wybraniec-Skardowska - 2016 - Axioms 5 (15).
    In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Reasoning About Uncertain Conditionals.Niki Pfeifer - 2014 - Studia Logica 102 (4):849-866.
    There is a long tradition in formal epistemology and in the psychology of reasoning to investigate indicative conditionals. In psychology, the propositional calculus was taken for granted to be the normative standard of reference. Experimental tasks, evaluation of the participants’ responses and psychological model building, were inspired by the semantics of the material conditional. Recent empirical work on indicative conditionals focuses on uncertainty. Consequently, the normative standard of reference has changed. I argue why neither logic nor standard probability (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  14. Non-classical Metatheory for Non-classical Logics.Andrew Bacon - 2013 - Journal of Philosophical Logic 42 (2):335-355.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  15. Truth and Proof without Models: A Development and Justification of the Truth-valuational Approach (2nd edition).Hanoch Ben-Yami - manuscript
    I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been raised against (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Lógica positiva : plenitude, potencialidade e problemas (do pensar sem negação).Tomás Barrero - 2004 - Dissertation, Universidade Estadual de Campinas
    This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  18. Hungarian disjunctions and positive polarity.Anna Szabolcsi - 2002 - In Istvan Kenesei & Peter Siptar (eds.), Approaches to Hungarian, Vol. 8. Univ. of Szeged.
    The de Morgan laws characterize how negation, conjunction, and disjunction interact with each other. They are fundamental in any semantics that bases itself on the propositional calculus/Boolean algebra. This paper is primarily concerned with the second law. In English, its validity is easy to demonstrate using linguistic examples. Consider the following: (3) Why is it so cold in here? We didn’t close the door or the window. The second sentence is ambiguous. It may mean that I suppose we (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  19. A note on verisimilitude and relativization to problems.Philippe Mongin - 1990 - Erkenntnis 33 (3):391-396.
    This note aims at critically assessing a little-noticed proposal made by Popper in the second edition of "Objective Knowledge" to the effect that verisimilitude of scientific theories should be made relative to the problems they deal with. Using a simple propositional calculus formalism, it is shown that the "relativized" definition fails for the very same reason why Popper's original concept of verisimilitude collapsed -- only if one of two theories is true can they be compared in terms of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  20. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. Problemy terminologiczne w argumentach za istnieniem Boga.Wolak Zbigniew - 2014 - Argument: Biannual Philosophical Journal 4 (2):341-358.
    In the article I deal with some paradoxes and errors caused by improper usage of logical and philosophical terms appearing in the arguments for existence of god and other philosophical issues. I point at rst some paradoxes coming om improper usage of propositional calculus as an instrument for analysis of a natural language. this language is actually not using simple sentences but rather propositional functions, their logical connections, and some replacements for variables in them. We still have (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. De Morgan's laws and NEG-raising: a syntactic view.Diego Gabriel Krivochen - 2018 - Linguistic Frontiers 1 (2):112-121.
    In this paper, we will motivate the application of specific rules of inference from the propositional calculus to natural language sentences. Specifically, we will analyse De Morgan’s laws, which pertain to the interaction of two central topics in syntactic research: negation and coordination. We will argue that the applicability of De Morgan’s laws to natural language structures can be derived from independently motivated operations of grammar and principles restricting the application of these operations. This has direct empirical consequences (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Gödel Mathematics Versus Hilbert Mathematics. II Logicism and Hilbert Mathematics, the Identification of Logic and Set Theory, and Gödel’s 'Completeness Paper' (1930).Vasil Penchev - 2023 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 15 (1):1-61.
    The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  25. Solving the Paradox of Material Implication - 2024 (2nd edition).Jan Pociej - forthcoming - Https://Doi.Org/10.6084/M9.Figshare.22324282.V3.
    The paradox of material implication has remained unresolved since antiquity because it was believed that the nature of implication was entailment. The article shows that this nature is opposition and therefore the name "implication" should be replaced with the name "competition". A solution to the paradox is provided along with appropriate changes in nomenclature, the addition of connectives and the postulate that the biconditional take over the role of the previous implication. In addition, changes to the nomenclature of logic gates (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. PM's Circumflex, Syntax and Philosophy of Types.Kevin C. Klement - 2011 - In Kenneth Blackwell, Nicholas Griffin & Bernard Linsky (eds.), Principia mathematica at 100. Hamilton, Ontario: Bertrand Russell Research Centre. pp. 218-246.
    Along with offering an historically-oriented interpretive reconstruction of the syntax of PM ( rst ed.), I argue for a certain understanding of its use of propositional function abstracts formed by placing a circum ex on a variable. I argue that this notation is used in PM only when de nitions are stated schematically in the metalanguage, and in argument-position when higher-type variables are involved. My aim throughout is to explain how the usage of function abstracts as “terms” (loosely speaking) (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. Qualia Logic.Paul Merriam - manuscript
    The logic of qualia is different than classical logic. We take the first steps in defining it and applying it to the Hard Problem.
    Download  
     
    Export citation  
     
    Bookmark  
  29. Qualia Logic 2 Brief Notes on Qualia Logic.Paul Merriam - manuscript
    Some not quite random thoughts on the logic of qualia.
    Download  
     
    Export citation  
     
    Bookmark  
  30. The Non-categoricity of Logic (I). The Problem of a Full Formalization (in Romanian).Constantin C. Brîncuș - 2022 - Probleme de Logică (Problems of Logic) (1):137-156.
    A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the standard (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31.  79
    Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - unknown
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  32. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
    This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  33. Triviality Results For Probabilistic Modals.Goldstein Simon - 2017 - Philosophy and Phenomenological Research 99 (1):188-222.
    In recent years, a number of theorists have claimed that beliefs about probability are transparent. To believe probably p is simply to have a high credence that p. In this paper, I prove a variety of triviality results for theses like the above. I show that such claims are inconsistent with the thesis that probabilistic modal sentences have propositions or sets of worlds as their meaning. Then I consider the extent to which a dynamic semantics for probabilistic modals can capture (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  34. Semantic Information and the Complexity of Deduction.Salman Panahy - 2023 - Erkenntnis 88 (4):1-22.
    In the chapter “Information and Content” of their Impossible Worlds, Berto and Jago provide us with a semantic account of information in deductive reasoning such that we have an explanation for why some, but not all, logical deductions are informative. The framework Berto and Jago choose to make sense of the above-mentioned idea is a semantic interpretation of Sequent Calculus rules of inference for classical logic. I shall argue that although Berto and Jago’s idea and framework are hopeful, their (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework).Damian E. Szmuc - 2021 - Bulletin of the Section of Logic 50 (4):421-453.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  36. Minimally Nonstandard K3 and FDE.Rea Golan & Ulf Hlobil - 2022 - Australasian Journal of Logic 19 (5):182-213.
    Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37. Transparent quantification into hyperpropositional contexts de re.Duží Marie & Bjørn Jespersen - 2012 - Logique & Analyse 55 (220):513-554.
    This paper is the twin of (Duží and Jespersen, in submission), which provides a logical rule for transparent quantification into hyperprop- ositional contexts de dicto, as in: Mary believes that the Evening Star is a planet; therefore, there is a concept c such that Mary be- lieves that what c conceptualizes is a planet. Here we provide two logical rules for transparent quantification into hyperpropositional contexts de re. (As a by-product, we also offer rules for possible- world propositional contexts.) (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Intensional models for the theory of types.Reinhard Muskens - 2007 - Journal of Symbolic Logic 72 (1):98-118.
    In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not validate the axiom of Extensionality. We give a cut-free sequent calculus for type theory and show completeness of this calculus with respect to the class of intensional models via a model existence theorem. After this we turn our attention to applications. (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  39. Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction.Moritz Cordes & Friedrich Reinmuth - 2017 - Logic and Logical Philosophy 26 (2).
    We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the original proof. We (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  40. Tableaux sin refutación.Tomás Barrero & Walter Carnielli - 2005 - Matemáticas: Enseñanza Universitaria 13 (2):81-99.
    Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  41. Topics in the Proof Theory of Non-classical Logics. Philosophy and Applications.Fabio De Martin Polo - 2023 - Dissertation, Ruhr-Universität Bochum
    Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. Binding On the Fly: Cross-Sentential Anaphora in Variable— Free Semantics.Anna Szabolcsi - 2003 - In R. Oehrle & J. Kruijff (eds.), Resource Sensitivity, Binding, and Anaphora. Kluwer Academic Publishers. pp. 215--227.
    Combinatory logic (Curry and Feys 1958) is a “variable-free” alternative to the lambda calculus. The two have the same expressive power but build their expressions differently. “Variable-free” semantics is, more precisely, “free of variable binding”: it has no operation like abstraction that turns a free variable into a bound one; it uses combinators—operations on functions—instead. For the general linguistic motivation of this approach, see the works of Steedman, Szabolcsi, and Jacobson, among others. The standard view in linguistics is that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  43. Automating Reasoning with Standpoint Logic via Nested Sequents.Tim Lyon & Lucía Gómez Álvarez - 2018 - In Michael Thielscher, Francesca Toni & Frank Wolter (eds.), Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR2018). pp. 257-266.
    Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44.  96
    Nelson’s logic ????Thiago Nascimento, Umberto Rivieccio, João Marcos & Matthew Spinks - 2020 - Logic Journal of the IGPL 28 (6):1182-1206.
    Besides the better-known Nelson logic and paraconsistent Nelson logic, in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $\mathcal{S}$. The logic $\mathcal{S}$ was originally presented by means of a calculus with infinitely many rule schemata and no semantics. We look here at the propositional fragment of $\mathcal{S}$, showing that it is algebraizable, in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  45. Wittgenstein's Ways.Nikolay Milkov - 2019 - In Shyam Wuppuluri & Newton da Costa (eds.), Wittgensteinian : Looking at the World From the Viewpoint of Wittgenstein's Philosophy. Springer Verlag. pp. 7-19.
    Aristotle first investigated different modes, or ways of being. Unfortunately, in the modern literature the discussion of this concept has been largely neglected. Only recently, the interest towards the concept of ways increased. Usually, it is explored in connection with the existence of universals and particulars. The approach we are going to follow in this chapter is different. It discusses Wittgenstein’s conception of higher ontological levels as ways of arranging elements of lower ontological levels. In the Tractatus, Wittgenstein developed his (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. A Modal Logic and Hyperintensional Semantics for Gödelian Intuition.David Elohim - manuscript
    This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. The Metaphysical Commitments of Logic.Thomas Brouwer - 2013 - Dissertation, University of Leeds
    This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Remarks on Wittgenstein, Gödel, Chaitin, Incompleteness, Impossiblity and the Psychological Basis of Science and Mathematics.Michael Richard Starks - 2019 - In Remarks on Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason in Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal. Reality Press. pp. 24-38.
    It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. Three Reflections on Return: Convergence of form with regard to light, life, word.Timothy M. Rogers - manuscript
    In this paper, I trace the three-fold essence of “return”—a generating trope of identity and difference, through which formal aspects of the theory of relativity, the movement of language and emergence in evolution might converge. The trope of return is contrasted with the more common two-fold structure of relatedness underwriting differential calculus, propositional semantics and reductionism, which privileges space over time, identity over difference, self over creation.
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000