3047 search results - page 15 / 610 » On the Meaning of Logical Completeness |
AIML
2004
14 years 11 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
80
Voted
TACS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
FROCOS
2000
Springer
15 years 1 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...