21 search results - page 2 / 5 » Weak Arithmetics and Kripke Models |
AML
2002
13 years 9 months ago
2002
For a classical theory T, H(T) denotes the intuitionistic theory of T-normal (i.e. locally T) Kripke structures. S. Buss has asked for a characterization of the theories in the ra...
TABLEAUX
1999
Springer
14 years 2 months ago
1999
Springer
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
AML
2002
13 years 9 months ago
2002
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...