Sciweavers

345 search results - page 2 / 69
» Kripke models for classical logic
Sort
View
TLCA
2007
Springer
14 years 1 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Model Checking Quantitative Linear Time Logic
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
Marco Faella, Axel Legay, Mariëlle Stoelinga
JAPLL
2007
113views more  JAPLL 2007»
13 years 7 months ago
Fresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the model of names and binding in abst...
Murdoch Gabbay
AML
2010
102views more  AML 2010»
13 years 7 months ago
Kripke models for subtheories of CZF
In this paper a method to construct Kripke models for subtheories of constructive set theory is introduced that uses constructions from classical model theory such as constructibl...
Rosalie Iemhoff
TABLEAUX
2007
Springer
14 years 1 months ago
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
Ryo Ishigaki, Kentaro Kikuchi