193 search results - page 23 / 39 » A Paraconsistent Higher Order Logic |
TOCL
2008
13 years 7 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
ECSQARU
2007
Springer
14 years 1 months ago
2007
Springer
Problems of conceptual uncertainty have been dealt with in theories of formal logic. Such theories try to accommodate vagueness in two main ways. One is fuzzy logic that introduces...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
This paper proposes a formalization in COQ of common knowledge logic and checks its adequacy on case studies. This exercise allows exploring experimentally the proof-theoretic sid...
CSL
2002
Springer
13 years 7 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...