Results 1  10
of
7,719
Cutfree Sequent Calculi for Csystems with Generalized Finitevalued Semantics
"... In [5], a general method was developed for generating cutfree ordinary sequent calculi for logics that can be characterized by finitevalued semantics based on nondeterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applyin ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In [5], a general method was developed for generating cutfree ordinary sequent calculi for logics that can be characterized by finitevalued semantics based on nondeterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made
Cutfree Display Calculi for Relation Algebras
, 1997
"... . We extend Belnap's Display Logic to give a cutfree Gentzenstyle calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the first purely propositional Gentzenstyle calculus for rela ..."
Abstract

Cited by 21 (14 self)
 Add to MetaCart
. We extend Belnap's Display Logic to give a cutfree Gentzenstyle calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the first purely propositional Gentzenstyle calculus
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract

Cited by 425 (124 self)
 Add to MetaCart
with its operational meaning, provided by interpreting logical connectives as simple and fixed search instructions. The operational semantics is formalized by the identification of a class of cutfree sequent proofs called uniform proofs. A uniform proof is one that can be found by a goaldirected search
Cutfree ordinary sequent calculi for logics having generalized finitevalued semantics
 Logica Universalis
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
DuplicationFree Tableau Calculi Together With CutFree and ContractionFree Sequent Calculi for the Interpolable . . .
, 1997
"... We get cutfree and contractionfree sequent calculi for the interpolable propositional intermediate logics by translating suitable duplicationfree tableau calculi developed within a semantical framework. From this point of view, the paper aims also to outline a general semantical method to get cut ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We get cutfree and contractionfree sequent calculi for the interpolable propositional intermediate logics by translating suitable duplicationfree tableau calculi developed within a semantical framework. From this point of view, the paper aims also to outline a general semantical method to get
Cutfree common knowledge
 Journal of Applied Logic
, 2007
"... Starting off from the infinitary system for common knowledge over multimodal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize ” this deductive system. The result is a cutfree, sound and complete sequent calculus for common knowledge. 1 ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
Starting off from the infinitary system for common knowledge over multimodal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize ” this deductive system. The result is a cutfree, sound and complete sequent calculus for common knowledge. 1
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Cutfree Sequent and Tableau Systems for Propositional Diodorean Modal Logics
"... We present sound, (weakly) complete and cutfree tableau systems for the propositional normal modal logics S4:3, S4:3:1 and S4:14. When the modality 2 is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of po ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
L depending only on X and the logic L. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive. Each tableau system has a cutfree sequent analogue
Results 1  10
of
7,719