Sciweavers

1410 search results - page 69 / 282
» Proving theorems by reuse
Sort
View
APAL
2006
91views more  APAL 2006»
13 years 10 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
JAR
2007
83views more  JAR 2007»
13 years 10 months ago
Theory Extension in ACL2(r)
ACL2(r) is a modified version of the theorem prover ACL2 that adds support for the irrational numbers using non-standard analysis. It has been used to prove basic theorems of anal...
Ruben Gamboa, John R. Cowles
JSYML
2007
51views more  JSYML 2007»
13 years 10 months ago
Forcing indestructibility of set-theoretic axioms
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the L´evy collapse. These show in particul...
Bernhard König
APAL
2000
84views more  APAL 2000»
13 years 9 months ago
Strong Splitting in Stable Homogeneous Models
In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [Hy]. We apply this to prove a structure theorem. We...
Tapani Hyttinen, Saharon Shelah
JGAA
2002
74views more  JGAA 2002»
13 years 9 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez