Results for 'proof-theoretic criterion for paradoxicality'

981 found
Order:
  1. On Proof-Theoretic Approaches to the Paradoxes: Problems of Undergeneration and Overgeneration in the Prawitz-Tennant Analysis.Seungrak Choi - 2019 - Dissertation, Korea University
    In this dissertation, we shall investigate whether Tennant's criterion for paradoxicality(TCP) can be a correct criterion for genuine paradoxes and whether the requirement of a normal derivation(RND) can be a proof-theoretic solution to the paradoxes. Tennant’s criterion has two types of counterexamples. The one is a case which raises the problem of overgeneration that TCP makes a paradoxical derivation non-paradoxical. The other is one which generates the problem of undergeneration that TCP renders a non-paradoxical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Harmony and Paradox: Intensional Aspects of Proof-Theoretic Semantics.Luca Tranchini - 2024 - Springer Verlag.
    This open access book investigates the role played by identity of proofs in proof-theoretic semantics. It develops a conception of proof-theoretic semantics as primarily concerned with the relationship between proofs (understood as abstract entities) and derivations (the linguistic representations of proofs). It demonstrates that identity of proof is a key both to clarify some —still not wholly understood— notions at the core of proof-theoretic semantics, such as harmony; and to broaden the range of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  60
    Proof-theoretic semantics, paradoxes and the distinction between sense and denotation.Luca Tranchini - forthcoming - Journal of Logic and Computation 2014.
    In this paper we show how Dummett-Prawitz-style proof-theoretic semantics has to be modified in order to cope with paradoxical phenomena. It will turn out that one of its basic tenets has to be given up, namely the definition of the correctness of an inference as validity preservation. As a result, the notions of an argument being valid and of an argument being constituted by correct inference rules will no more coincide. The gap between the two notions is accounted (...)
    Direct download  
     
    Export citation  
     
    Bookmark   20 citations  
  4.  7
    Paradoxes, Intuitionism, and Proof-Theoretic Semantics.Reinhard Kahle & Paulo Guilherme Santos - 2024 - In Thomas Piecha & Kai F. Wehmeier (eds.), Peter Schroeder-Heister on Proof-Theoretic Semantics. Springer. pp. 363-374.
    In this note, we review paradoxes like Russell’s, the Liar, and Curry’s in the context of intuitionistic logic. One may observe that one cannot blame the underlying logic for the paradoxes, but has to take into account the particular concept formations. For proof-theoretic semantics, however, this comes with the challenge to block some forms of direct axiomatizations of the Liar. A proper answer to this challenge might be given by Schroeder-Heister’s definitional freedom.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  68
    Normalizability, cut eliminability and paradox.Neil Tennant - 2016 - Synthese 199 (Suppl 3):597-616.
    This is a reply to the considerations advanced by Schroeder-Heister and Tranchini as prima facie problematic for the proof-theoretic criterion of paradoxicality, as originally presented in Tennant and subsequently amended in Tennant. Countering these considerations lends new importance to the parallelized forms of elimination rules in natural deduction.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  6.  46
    A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
    We define proof nets for cyclic multiplicative linear logic as edge bi-coloured graphs. Our characterization is purely graph theoretical and works without further complication for proof nets with cuts, which are usually harder to handle in the non-commutative case. This also provides a new characterization of the proof nets for the Lambek calculus (with the empty sequence) which simply are a restriction on the formulas to be considered (which are asked to be intuitionistic).
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  7. A proof-theoretical view of collective rationality.Daniele Porello - 2013 - In Proceedings of the 23rd International Joint Conference of Artificial Intelligence (IJCAI 2013).
    The impossibility results in judgement aggregation show a clash between fair aggregation procedures and rational collective outcomes. In this paper, we are interested in analysing the notion of rational outcome by proposing a proof-theoretical understanding of collective rationality. In particular, we use the analysis of proofs and inferences provided by linear logic in order to define a fine-grained notion of group reasoning that allows for studying collective rationality with respect to a number of logics. We analyse the well-known paradoxes (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  32
    Advances in Proof-Theoretic Semantics.Peter Schroeder-Heister & Thomas Piecha (eds.) - 2015 - Cham, Switzerland: Springer Verlag.
    This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  9.  28
    The Identity of Proofs and the Criterion for Admissible Reductions.Seungrak Choi - 2021 - Korean Journal of Logic 3 (24):245-280.
    Dag Prawitz (1971) put forward the idea that an admissible reduction process does not affect the identity of proofs represented by derivations in natural deduction. The idea relies on his conjecture that two derivations represent the same proof if and only if they are equivalent in the sense that they are reflexive, transitive and symmetric closure of the immediate reducibility relation. Schroeder-Heister and Tranchini (2017) accept Prawitz’s conjecture and propose the triviality test as the criterion for admissible reductions. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  10. What are acceptable reductions? Perspectives from proof-theoretic semantics and type theory.Sara Ayhan - 2023 - Australasian Journal of Logic 20 (3):412-428.
    It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the same conclusion would have to be identified. In this paper it will be shown that the question, which reductions we accept in our system, is not only important if we see them as generating a theory of proof identity but is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. Proof-theoretic semantics for a natural language fragment.Nissim Francez & Roy Dyckhoff - 2010 - Linguistics and Philosophy 33 (6):447-477.
    The paper presents a proof-theoretic semantics (PTS) for a fragment of natural language, providing an alternative to the traditional model-theoretic (Montagovian) semantics (MTS), whereby meanings are truth-condition (in arbitrary models). Instead, meanings are taken as derivability-conditions in a dedicated natural-deduction (ND) proof-system. This semantics is effective (algorithmically decidable), adhering to the meaning as use paradigm, not suffering from several of the criticisms formulated by philosophers of language against MTS as a theory of meaning. In particular, Dummett’s (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  12.  24
    Abduction as Deductive Saturation: a Proof-Theoretic Inquiry.Mario Piazza, Gabriele Pulcini & Andrea Sabatini - 2023 - Journal of Philosophical Logic 52 (6):1575-1602.
    Abductive reasoning involves finding the missing premise of an “unsaturated” deductive inference, thereby selecting a possible _explanans_ for a conclusion based on a set of previously accepted premises. In this paper, we explore abductive reasoning from a structural proof-theory perspective. We present a hybrid sequent calculus for classical propositional logic that uses sequents and antisequents to define a procedure for identifying the set of analytic hypotheses that a rational agent would be expected to select as _explanans_ when presented with (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13. Proof-Theoretic Semantics for Subsentential Phrases.Nissim Francez, Roy Dyckhoff & Gilad Ben-Avi - 2010 - Studia Logica 94 (3):381-401.
    The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  14.  29
    Syntactic Proofs for Yablo’s Paradoxes in Temporal Logic.Ahmad Karimi - forthcoming - Logic and Logical Philosophy:1.
    Temporal logic is of importance in theoretical computer science for its application in formal verification, to state requirements of hardware or software systems. Linear temporal logic is an appropriate logical environment to formalize Yablo’s paradox which is seemingly non-self-referential and basically has a sequential structure. We give a brief review of Yablo’s paradox and its various versions. Formalization of these paradoxes yields some theorems in Linear Temporal Logic (LTL) for which we give syntactic proofs using an appropriate axiomatization of LTL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  38
    Proof-Theoretic Semantics for Natural Language.Nissim Francez - 2019 - Topoi 40 (1):55-69.
    The paper has two parts: 1. A brief exposition of proof-theoretic semantics, not necessarily in connection to natural language. 2. A review, with a contrastive flavour, of some of the applications of PTS to NL with an indication of advantages of PTS as a theory of meaning for NL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  15
    Softness of MALL proof-structures and a correctness criterion with Mix.Masahiro Hamano - 2004 - Archive for Mathematical Logic 43 (6):751-794.
    We show that every MALL proof-structure [9] satisfies the property of softness, originally a categorical notion introduced by Joyal. Furthermore, we show that the notion of hereditary softness precisely captures Girard’s algebraic restriction of the technical condition on proof-structures. Relying on this characterization, we prove a MALL+Mix sequentialization theorem by a proof-theoretical method, using Girard’s notion of jump. Our MALL+Mix correctness criterion subsumes the Danos/Fleury-Retoré criterion [6] for MLL+Mix.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17. Proof-theoretic Semantics for Classical Mathematics.William W. Tait - 2006 - Synthese 148 (3):603-622.
    We discuss the semantical categories of base and object implicit in the Curry-Howard theory of types and we derive derive logic and, in particular, the comprehension principle in the classical version of the theory. Two results that apply to both the classical and the constructive theory are discussed. First, compositional semantics for the theory does not demand ‘incomplete objects’ in the sense of Frege: bound variables are in principle eliminable. Secondly, the relation of extensional equality for each type is definable (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  50
    On Paradoxes in Normal Form.Mattia Petrolo & Paolo Pistone - 2019 - Topoi 38 (3):605-617.
    A proof-theoretic test for paradoxicality was famously proposed by Tennant: a paradox must yield a closed derivation of absurdity with no normal form. Drawing on the remark that all derivations of a given proposition can be transformed into derivations in normal form of a logically equivalent proposition, we investigate the possibility of paradoxes in normal form. We compare paradoxes à la Tennant and paradoxes in normal form from the viewpoint of the computational interpretation of proofs and from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  19. Sketch of a Proof-Theoretic Semantics for Necessity.Nils Kürbis - 2020 - In Nicola Olivetti, Rineke Verbrugge & Sara Negri (eds.), Advances in Modal Logic 13. Booklet of Short Papers. Helsinki: pp. 37-43.
    This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  27
    A Proof-Theoretic Semantics for Adjectival Modification.Nissim Francez - 2017 - Journal of Logic, Language and Information 26 (1):21-43.
    The paper introduces a proof-theoretic semantics for adjectival modification as an alternative to the traditional model-theoretic semantics basing meaning on truth-conditions. The paper considers the proof-theoretic meaning of modification by means of the three traditional adjective classes: intersective, subsective and privative. It does so by introducing a meaning-conferring natural-deduction proof system for such modification. The PTS theory of meaning is not polluted by ontological commitments, for example, a scale for beauty and a yardstick for (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  11
    Ontological Purity for Formal Proofs.Robin Martinot - forthcoming - Review of Symbolic Logic:1-40.
    Purity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the notions of surrogate ontological content and structural content. From there, we characterize which (classical) first-order natural (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  58
    Paradoxical consequences of Balzer's and gähde's criteria of theoreticity. Results of an application to ten scientific theories.Gerhard Schurz - 1990 - Erkenntnis 32 (2):161 - 214.
    It is shown that the criteria of T-theoreticity proposed by Balzer and Gähde lead to strongly counterintuitive and in this sense paradoxical results: most of the obviously empirical or at least nontheoretical terms come out as theoretical. This is demonstrated for a lot of theories in different areas. On the way, some improved and some new structuralist theory-reconstructions are given. The conclusion is drawn that the T-theoreticity of a term cannot possibly be proved on the basis of the mathematical structure (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  23. Uniform proof-theoretic semantics for logical constants.Peter Schroeder-Heister - 1991 - Journal of Symbolic Logic 56:1142.
  24. For reflexivity as an epistemic criterion of ontological coherence and virtuous social theorizing.Christoforos Bouzanis - 2017 - History of the Human Sciences 30 (5):125-146.
    This article offers an approach that combines, on the one hand, the philosophical notion of reflexivity, which is related to the ideas of self-reference and paradox, and, on the other hand, the sociological discussion of epistemic reflexivity as a problem of coherence, which was mainly initiated by certain branches of ethnomethodology and social constructionism. This combinatory approach argues for reflexivity as an epistemic criterion of ontological coherence, which suggests that social ontologies should account for the possibility of self-reflective subjectivity (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  25.  8
    A prooftheoretic metatheorem for tracial von Neumann algebras.Liviu Păunescu & Andrei Sipoş - 2023 - Mathematical Logic Quarterly 69 (1):63-76.
    We adapt a continuous logic axiomatization of tracial von Neumann algebras due to Farah, Hart and Sherman in order to prove a metatheorem for this class of structures in the style of proof mining, a research programme that aims to obtain the hidden computational content of ordinary mathematical proofs using tools from proof theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  27
    Towards a Proof-Theoretic Semantics for Dynamic Logics.V. Sikimic - unknown
    This thesis provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. After an illustration of the basic principles of proof-theoretic semantics, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reject on them in the light of proof-theoretic semantic principles. The main original contributions of the present thesis are: (a) a revised version of the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  27. Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality.Nils Kürbis - 2015 - Journal of Philosophical Logic 44 (6):713-727.
    This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  28.  6
    Multicomponent proof-theoretic method for proving interpolation properties.Roman Kuznets - 2018 - Annals of Pure and Applied Logic 169 (12):1369-1418.
  29.  15
    A Proof-Theoretic Semantics for Exclusion.Nissim Francez & Michael Kaminski - 2017 - Logica Universalis 11 (4):489-505.
    The paper provides a proof-theory for a negative presentation of classical logic based on a single primitive of exclusion, generalizing the known presentation via the binary ‘nand. The completeness is established via deductive equivalence to Gentzens NK/LK systems.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  27
    A proof-theoretic framework for logic programming.Gerhard Jäger & Robert F. Stärk - 1998 - In Samuel R. Buss (ed.), Bulletin of Symbolic Logic. Elsevier. pp. 639--682.
  31.  99
    A ProofTheoretic Account of the Miners Paradox.Ansten Klev - 2016 - Theoria 82 (4):351-369.
    By maintaining that a conditional sentence can be taken to express the validity of a rule of inference, we offer a solution to the Miners Paradox that leaves both modus ponens and disjunction elimination intact. The solution draws on Sundholm's recently proposed account of Fitch's Paradox.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  75
    Proof-theoretic semantic values for logical operators.Nissim Francez & Gilad Ben-avi - 2011 - Review of Symbolic Logic 4 (3):466-478.
    The paper proposes a semantic value for the logical constants (connectives and quantifiers) within the framework of proof-theoretic semantics, basic meaning on the introduction rules of a meaning conferring natural deduction proof system. The semantic value is defined based on Fregecontributions” to sentential meanings as determined by the function-argument structure as induced by a type-logical grammar. In doing so, the paper proposes a novel proof-theoretic interpretation of the semantic types, traditionally interpreted in Henkin models. The (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  33.  21
    Proof-theoretic semantics as a resource for expressing semantic variability.Nissim Francez - 2022 - Synthese 200 (4):1-27.
    The paper highlights proof-theoretic semantics as providing natural resources for capturing semantic variation in natural language. The semantic variations include:Distinction between extensional predication and attribution to intensional transitive verbs a non-specific object.Omission of a verbal argument in a transitive verb.Obtaining sameness of meaning of sentences with transitive verbs with omitted object and existentially quantified object.Blocking unwarranted entailments in adjective–noun combinations.Capturing quantifier scope ambiguity.Obtaining context dependent quantifier domain restriction. The proof-theoretic resources employed to capture the above semantic (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  37
    Theoretical Lenses for Understanding the CSR–Consumer Paradox.Catherine Janssen & Joëlle Vanhamme - 2015 - Journal of Business Ethics 130 (4):775-787.
    Consumer surveys repeatedly suggest that corporate social responsibility and products’ social, environmental, or ethical attributes enhance consumers’ purchase intentions. The realization that CSR still has only a minor impact on consumers’ actual purchase decisions thus represents a puzzling paradox. Whereas prior literature on consumer decision making provides valuable insights into the factors that impede or facilitate consumers’ socially responsible consumption decisions, such elements may be only the tip of the iceberg. To gain a fuller understanding of the CSR–consumer paradox, this (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  92
    Proof-Theoretical Semantics and Fregean Identity Criteria for Propositions.Göran Sundholm - 1994 - The Monist 77 (3):294-314.
    In his Grundgesetze, §32, Frege launched the idea that the meaning of a sentence is given by its truth condition, or, in his particular version, the condition under which it will be a name of the True. This, indeed, was only one of the many roles in which truth has to serve within the Fregean system. In particular, truth is an absolute notion in the sense that bivalence holds: every Gedanke is either true or false, in complete independence of any (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  36. L'etica moderna. Dalla Riforma a Nietzsche.Sergio Cremaschi - 2007 - Roma RM, Italia: Carocci.
    This book tells the story of modern ethics, namely the story of a discourse that, after the Renaissance, went through a methodological revolution giving birth to Grotius’s and Pufendorf’s new science of natural law, leaving room for two centuries of explorations of the possible developments and implications of this new paradigm, up to the crisis of the Eighties of the eighteenth century, a crisis that carried a kind of mitosis, the act of birth of both basic paradigms of the two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  37.  15
    A Proof-Theoretic Bound Extraction Theorem for CAT $$(\kappa )$$ ( κ ) -Spaces.U. Kohlenbach & A. Nicolae - 2017 - Studia Logica 105 (3):611-624.
    Starting in 2005, general logical metatheorems have been developed that guarantee the extractability of uniform effective bounds from large classes of proofs of theorems that involve abstract metric structures X. In this paper we adapt this to the class of CAT\)-spaces X for \ and establish a new metatheorem that explains specific bound extractions that recently have been achieved in this context as instances of a general logical phenomenon.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  90
    Proof-Theoretic Semantics, Self-Contradiction, and the Format of Deductive Reasoning.Peter Schroeder-Heister - 2012 - Topoi 31 (1):77-85.
    From the point of view of proof-theoretic semantics, it is argued that the sequent calculus with introduction rules on the assertion and on the assumption side represents deductive reasoning more appropriately than natural deduction. In taking consequence to be conceptually prior to truth, it can cope with non-well-founded phenomena such as contradictory reasoning. The fact that, in its typed variant, the sequent calculus has an explicit and separable substitution schema in form of the cut rule, is seen as (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  39. Strategy-proof judgment aggregation.Franz Dietrich & Christian List - 2005 - Economics and Philosophy 23 (3):269-300.
    Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than (...)
    Direct download (20 more)  
     
    Export citation  
     
    Bookmark   51 citations  
  40.  10
    On $${{{\mathcal {F}}}}$$-Systems: A Graph-Theoretic Model for Paradoxes Involving a Falsity Predicate and Its Application to Argumentation Frameworks.Gustavo Bodanza - 2023 - Journal of Logic, Language and Information 32 (3):373-393.
    $${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  25
    Peter Schroeder-Heister on Proof-Theoretic Semantics.Thomas Piecha & Kai F. Wehmeier (eds.) - 2024 - Springer.
    This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  18
    Proof-theoretic strengths of weak theories for positive inductive definitions.Toshiyasu Arai - 2018 - Journal of Symbolic Logic 83 (3):1091-1111.
  43.  28
    Proof and truth: an anti-realist perspective.Luca Tranchini - 2013 - Pisa: Edizioni ETS. Edited by Luca Tranchini.
    In the first chapter, we discuss Dummett’s idea that the notion of truth arises from the one of the correctness of an assertion. We argue that, in a first-order language, the need of defining truth in terms of the notion of satisfaction, which is yielded by the presence of quantifiers, is structurally analogous to the need of a notion of truth as distinct from the one of correctness of an assertion. In the light of the analogy between predicates in Frege (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  44.  57
    A new correctness criterion for multiplicative non-commutative proof nets.Roberto Maieli - 2003 - Archive for Mathematical Logic 42 (3):205-220.
    We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the non- commutative counterpart to the Danos-Regnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net can be naturally viewed as a series-parallel order variety on the conclusions of the proof net.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  40
    Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere.Torben Braüner - 2005 - Studia Logica 81 (2):191-226.
    A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  28
    Proof-Theoretical Semantics and Fregean Identity Criteria for Propositions.B. G. Sundholm - 1994 - The Monist 77 (3):294-314.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Proof-Theoretic Semantics and Inquisitive Logic.Will Stafford - 2021 - Journal of Philosophical Logic 50 (5):1199-1229.
    Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting (...)-theoretic validity to allow double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  51
    A new correctness criterion for the proof nets of non-commutative multiplicative linear logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
    This paper presents a new correctness criterion for marked Danos-Reginer graphs (D-R graphs, for short) of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. A New Correctness Criterion For The Proof Nets Of Non-commutative Multiplicative Linear Logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
    This paper presents a new correctness criterion for marked Danos-Reginer graphs of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.
     
    Export citation  
     
    Bookmark  
  50.  10
    Prooftheoretic semantics of natural deduction based on inversion.Ernst Zimmermann - 2021 - Theoria 87 (6):1651-1670.
    The article presents a full prooftheoretic semantics for natural deduction based on an extended inversion principle: the elimination rule for an operator q may invert the introduction rule for q, but also vice versa, the introduction rule for a connective q may invert the elimination rule for q. Such an inversion—extending Prawitz' concept of inversion—gives the following theorem: Inversion for two rules of operator q (intro rule, elim rule) exists iff a reduction of a maximum formula for q (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 981