Results 11 to 20 of about 206,152 (285)
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont
This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics.
Bolotov Alexander, Shangin Vasilyi
doaj +2 more sources
Peirce's Rule in Natural Deduction
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
A Classification of Improper Inference Rules
In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper as opposed to proper ones.
Katsumi Sasaki
doaj +1 more source
The Naturality of Natural Deduction [PDF]
Developing a suggestion by Russell, Prawitz showed how the usual natural deduction inference rules for disjunction, conjunction and absurdity can be derived using those for implication and the second order quantifier in propositional intuitionistic second order logic $NI^2$.
Luca Tranchini +2 more
openaire +3 more sources
A Sequent Systems without Improper Derivations
In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper, and others proper. Improper inference rules are
Katsumi Sasaki
doaj +1 more source
Non-idempotent types for classical calculi in natural deduction style [PDF]
In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types.
Delia Kesner, Pierre Vial
doaj +1 more source
Between Thinking and Acting Fichte’s Deduction of the Concept of Right [PDF]
Fichte’s ambitious project in the Foundations of Natural Right is to provide an a priori deduction of the concept of right independently from morality.
Laurenz Ramsauer
doaj +1 more source
Proof Compression and NP Versus PSPACE II: Addendum
In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
A Proof Theoretic Analysis of Intruder Theories [PDF]
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo ...
Alwen F Tiu, Rajeev Gore, Jeremy Dawson
doaj +1 more source
Proof Compression and NP Versus PSPACE II
We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2].
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source

