105 search results - page 2 / 21 » Optimal Proof Systems for Propositional Logic and Complete S... |
CSR
2009
Springer
13 years 8 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
TLCA
2009
Springer
13 years 12 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
LOGCOM
1998
13 years 5 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...