21 search results - page 1 / 5 » Weak Arithmetics and Kripke Models |
MLQ
2002
13 years 9 months ago
2002
JSYML
2002
13 years 9 months ago
2002
We show that Intuitionistic Open Induction iop is not closed under the rule DNS(1 ). This is established by constructing a Kripke model of iop+
APAL
2010
13 years 10 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
LOGCOM
2010
13 years 8 months ago
2010
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...