1101 search results - page 21 / 221 » Forcing in proof theory |
113
click to vote
APAL
2006
15 years 3 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
133
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
136
click to vote
ISCIS
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
117
Voted
IANDC
2006
15 years 3 months ago
2006
The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a cons...
109
click to vote
MOC
1998
15 years 3 months ago
1998
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...