2585 search results - page 323 / 517 » Automating Coherent Logic |
169
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
169
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
184
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
164
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
171
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...