1302 search results - page 32 / 261 » Free-Style Theorem Proving |
JSYML
2002
13 years 7 months ago
2002
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
ECCC
2010
13 years 6 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
JAIR
2011
13 years 2 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
SIAMMA
2010
13 years 2 months ago
2010
This work deals with trace theorems for a class of ramified bidimensional domains with a self-similar fractal boundary . The fractal boundary is supplied with a probability measur...
DAM
1998
13 years 7 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...