✦ LIBER ✦

First-order approximation of algorithmic theories

✍ Scribed by Wiktor Dańko

Book ID: 107948559
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 888 KB
Volume: 48
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90097-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

First order meta theories

✍ Hutchinson, A 📂 Article 📅 1997 🏛 Oxford University Press 🌐 English ⚖ 413 KB

Approximate theory for diffuse first-ord

Approximate theory for diffuse first-order phase transitions

✍ Tobolsky, A. V. ;Canter, N. H. 📂 Article 📅 2007 🏛 Wiley (John Wiley & Sons) ⚖ 488 KB

Dependent first order theories, continue

Dependent first order theories, continued

✍ Saharon Shelah 📂 Article 📅 2009 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 622 KB

Fregean Extensions of First-Order Theori

Fregean Extensions of First-Order Theories

✍ John L. Bell 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

## Abstract It is shown by Parsons [2] that the first‐order fragment of Frege's (inconsistent) logical system in the __Grundgesetze der Arithmetic__ is consistent. In this note we formulate and prove a stronger version of this result for arbitrary first‐order theories. We also show that a natural a

First Order Approximation of the 5-dimen

First Order Approximation of the 5-dimensional Projective Unified Field Theory

✍ Prof. Dr. E. Schmutzer; Dipl.-Phys. P. Kroll 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 603 KB

First Order Theories for Partial Models

✍ Bożena Staruch; Bogdan Staruch 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 197 KB