✦ LIBER ✦

Not Every "Tabular" Predicate Logic is Finitely Axiomatizable

✍ Scribed by Dmitrij Skvortsov

Book ID: 110219889
Publisher: Springer Netherlands
Year: 1997
Tongue: English
Weight: 241 KB
Volume: 59
Category: Article
ISSN: 0039-3215
DOI: 10.1023/a:1005088429206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite axiomatizability of locally tabul

Finite axiomatizability of locally tabular superintuitionistic logics

✍ A. I. Tsitkin 📂 Article 📅 1986 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 310 KB

The Class of Prime Semilattices is Not F

The Class of Prime Semilattices is Not Finitely Axiomatizable

✍ Keith A. Kearnes 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 101 KB

The class of all embeddable semigroup am

The class of all embeddable semigroup amalgams is not finitely axiomatizable

✍ Deko V. Dekov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Not every finite lattice is embeddable i

Not every finite lattice is embeddable in the recursively enumerable degrees

✍ A.H Lachlan; R.I Soare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 469 KB

## A certain lattice with eight elements is shown to be not embeddable as a lattice in the recursively enumerable degrees. This refutes the well-known Embedding Conjecture which asserted that every finite lattice could be so embedded.