Construction of sentences with specific interpretability properties

A. Stern

The search session has expired. Please query the service again.

Displaying similar documents to “Construction of sentences with specific interpretability properties”

Corcoran's Aristotelian syllogistic as a subsystem of first-order logic.

Andrade, Edgar J., Becerra, Edward (2007)

Revista Colombiana de Matemáticas

Similarity:

Simplicity simplified.

Casanovas, Enrique (2007)

Revista Colombiana de Matemáticas

Similarity:

Strong completeness of the Lambek Calculus with respect to Relational Semantics

Szabolcs Mikulás (1993)

Banach Center Publications

Similarity:

In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.

Reduced products of infinite forcing systems.

Grulović, Milan Z. (2002)

Novi Sad Journal of Mathematics

Similarity:

Arithmetical transfinite induction and hierarchies of functions

Z. Ratajczyk (1992)

Fundamenta Mathematicae

Similarity:

We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris-Harrington Theorem, and a version of the Solovay-Ketonen Theorem. We give uniform proofs using combinatorial constructions.

An extension of the probability logic $L P P_{2}$

Tatjana Stojanović, Ana Kaplarević-Mališić, Zoran Ognjanović (2010)

Kragujevac Journal of Mathematics

Similarity:

$L_{A C P}^{k} >$ logic and completeness theorem

Vladimir Ristić (2006)

Kragujevac Journal of Mathematics

Similarity:

What the finitization problem is not

A. Simon (1993)

Banach Center Publications

Similarity:

Algebraic real analysis.

Freyd, Peter (2008)

Theory and Applications of Categories [electronic only]

Similarity:

Complexity of the decidability of the unquantified set theory with a rank operator.

Tetruashvili, M. (1994)

Georgian Mathematical Journal

Similarity:

Compactness and Löwenheim-Skolem properties in categories of pre-institutions

Antonino Salibra, Giuseppe Scollo (1993)

Banach Center Publications

Similarity:

The abstract model-theoretic concepts of compactness and Löwenheim-Skolem properties are investigated in the "softer" framework of pre-institutions [18]. Two compactness results are presented in this paper: a more informative reformulation of the compactness theorem for pre-institution transformations, and a theorem on natural equivalences with an abstract form of the first-order pre-institution. These results rely on notions of compact transformation, which are introduced as arrow-oriented...

Computably rigid models with enumerable submodels.

Buzykaeva, A.N. (2002)

Sibirskij Matematicheskij Zhurnal

Similarity:

Beta-reduction as unification

A. Kfoury (1999)

Banach Center Publications

Similarity:

We define a new unification problem, which we call β-unification and which can be used to characterize the β-strong normalization of terms in the λ-calculus. We prove the undecidability of β-unification, its connection with the system of intersection types, and several of its basic properties.

Strong normalization proofs for cut elimination in Gentzen's sequent calculi

Elias Bittar (1999)

Banach Center Publications

Similarity:

We define an equivalent variant $L K_{s p}$ of the Gentzen sequent calculus $L K$ . In $L K_{s p}$ weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules $_{L K_{s p}}$ by a finite rewriting system; the termination of this rewriting system can be machine checked. We give also a self-contained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation;...