Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A system of interaction and structure
A Guglielmi - ACM Transactions on Computational Logic (TOCL), 2007 - dl.acm.org
This article introduces a logical system, called BV, which extends multiplicative linear logic
by a noncommutative self-dual logical operator. This extension is particularly challenging for …
by a noncommutative self-dual logical operator. This extension is particularly challenging for …
Deep sequent systems for modal logic
K Brünnler - Archive for Mathematical Logic, 2009 - Springer
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics
formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference …
formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference …
A comparison of reasoning techniques for querying large description logic aboxes
Many modern applications of description logics (DLs) require answering queries over large
data quantities, structured according to relatively simple ontologies. For such applications …
data quantities, structured according to relatively simple ontologies. For such applications …
[КНИГА][B] Deep inference and symmetry in classical proofs
K Brünnler - 2004 - people.bath.ac.uk
In this thesis we see deductive systems for classical propositional and predicate logic which
use deep inference, ie inference rules apply arbitrarily deep inside formulas, and a certain …
use deep inference, ie inference rules apply arbitrarily deep inside formulas, and a certain …
Non-commutativity and MELL in the calculus of structures
We introduce the calculus of structures: it is more general than the sequent calculus and it
allows for cut elimination and the subformula property. We show a simple extension of …
allows for cut elimination and the subformula property. We show a simple extension of …
On the proof complexity of deep inference
We obtain two results about the proof complexity of deep inference:(1) Deep-inference proof
systems are as powerful as Frege ones, even when both are extended with the Tseitin …
systems are as powerful as Frege ones, even when both are extended with the Tseitin …
[PDF][PDF] Linear logic and noncommutativity in the calculus of structures
L Straßburger - 2003 - lix.polytechnique.fr
Proof theory is the area of mathematics which studies the concepts of mathematical proof
and mathematical provability [Bus98]. It is mainly concerned with the formal syntax of logical …
and mathematical provability [Bus98]. It is mainly concerned with the formal syntax of logical …
Normalisation control in deep inference via atomic flows
We introduceatomic flows': they are graphs obtained from derivations by tracing atom
occurrences and forgetting the logical structure. We study simple manipulations of atomic …
occurrences and forgetting the logical structure. We study simple manipulations of atomic …
A proof calculus which reduces syntactic bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs
is available through the tree structure. We present in this paper a logic-independent proof …
is available through the tree structure. We present in this paper a logic-independent proof …
[КНИГА][B] Proof-theoretical coherence
K Došen, Z Petrić - 2004 - mi.sanu.ac.rs
This is a book in categorial (or categorical) proof theory, a field of general proof theory at the
border between logic and category theory. In this field the language, more than the methods …
border between logic and category theory. In this field the language, more than the methods …