Strong completeness of the Lambek Calculus with respect to Relational Semantics

Szabolcs Mikulás

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

Displaying similar documents to “Strong completeness of the Lambek Calculus with respect to Relational Semantics”

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

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

Revista Colombiana de Matemáticas

Similarity:

What the finitization problem is not

A. Simon (1993)

Banach Center Publications

Similarity:

The Derivations of Temporal Logic Formulas

Mariusz Giero (2012)

Formalized Mathematics

Similarity:

This is a preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [12]. We introduce n-ary connectives and prove their properties. We derive temporal logic formulas.

Computational Interrpretations of Logics

Silvia Ghilezan, Silvia Likavec (2009)

Zbornik Radova

Similarity:

Normal forms in partial modal logic

Jan Jaspars (1993)

Banach Center Publications

Similarity:

A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].

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

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

Kragujevac Journal of Mathematics

Similarity:

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;...

An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.

Rimatskiĭ, V.V. (2009)

Sibirskij Matematicheskij Zhurnal

Similarity:

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

Vladimir Ristić (2006)

Kragujevac Journal of Mathematics

Similarity:

Construction of sentences with specific interpretability properties

A. Stern (1993)

Fundamenta Mathematicae

Similarity:

The Rowland Institute for Science, 100 Cambridge Parkway, Cambridge, Massachusetts 02142, U.S.A. A construction is presented for generating sentences that satisfy a recursively enumerable set of interpretability properties. This construction is then used to prove three previously announced results concerning the lattice of local interpretability types of theories (also known as the Lattice of Chapters).

On Semantics of a Term Calculus for Classical Logic

Silvia Likavec, Pierre Lescanne (2012)

Publications de l'Institut Mathématique

Similarity:

A Parigot-style linear $λ$ -calculus for full intuitionistic linear logic.

de Paiva, Valeria, Ritter, Eike (2006)

Theory and Applications of Categories [electronic only]

Similarity: