✦ LIBER ✦

Autoepistemic logic of first order and its expressive power

✍ Scribed by Li-Yan Yuan

Publisher: Springer Netherlands
Year: 1994
Tongue: English
Weight: 1008 KB
Volume: 13
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00881912

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Expressive Power of Equality-Free

On the Expressive Power of Equality-Free First Order Languages

✍ P. Ecsedi-Tóth 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB

First-order logic — The unity of fuzzine

First-order logic — The unity of fuzziness and randomness

✍ Zhang Zhen; YunJuan Cao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Investigations on Fragments of First Ord

Investigations on Fragments of First Order Branching Temporal Logic

✍ Franco Montagna; G. Michele Pinna; B. P. Tiezzi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

Decidability and Definability Results Co

Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic

✍ Bogdan Stanislaw Chlebus 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

DECIDABILITY AND DEFINABILITY RESULTS CONCERNING WELL-ORDERINGS AND SOME EXTENSIONS OF FIRST ORDER LOGIC by BOGDAN STANISLAW CHLEBUS in Warsaw (Poland) ## 1. Introdiirtion Let L\* denote a countable extension of the first order language L. I n this paper 1 ) definability of the class of well-order

Recursive complexity of the Carnap first

Recursive complexity of the Carnap first order modal logic C

✍ Amélie Gheerbrant; Marcin Mostowski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

We consider first order modal logic C firstly defined by Carnap in "Meaning and Necessity" [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0 .

Simple proof of the completeness theorem

Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic

✍ Karim Nour; Christophe Raffalli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

We present a simpler way than usual to deduce the completeness theorem for the second-order classical logic from the ÿrst-order one. We also extend our method to the case of second-order intuitionistic logic.