Results 11 to 20 of about 4,442,858 (282)
Adjoint Natural Deduction. [PDF]
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has been defined in the form of a sequent calculus because the central concept of independence is most clearly understood
Junyoung Jang 0001 +3 more
openaire +4 more sources
Tuning Natural Deduction Proof Search by Analytic Methods [PDF]
This paper is a result of the analysis of the efficiency of natural deduction proof search and the major weaknesses affecting it. We introduce new analytic strategies based on a new concept ”Truth Set of Support”.
Bolotov, A., Gorchakov, A.
core +6 more sources
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
Parallel Verification of Natural Deduction Proof Graphs
Graph-based interactive theorem provers offer a visual representation of proofs, explicitly representing the dependencies and inferences between each of the proof steps in a graph or hypergraph format.
Oswald, James T., Rozek, Brandon
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
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
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
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
A note on strong normalization in classical natural deduction [PDF]
In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction.
José Espírito Santo
doaj +1 more source
Logic program specialisation through partial deduction: Control Issues [PDF]
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to ...
Bruynooghe, Maurice, Leuschel, Michael
core +2 more sources

