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
✦ LIBER ✦
A First Order Nonmonotonic Extension of Constructive Logic
✍ Scribed by David Pearce; Agustín Valverde
- Publisher
- Springer Netherlands
- Year
- 2005
- Tongue
- English
- Weight
- 330 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Decidability and Definability Results Co
✍
Bogdan Stanislaw Chlebus
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 452 KB
Equational treatment of first-order logi
✍
J. Mycielski
📂
Article
📅
1995
🏛
Springer
🌐
English
⚖ 578 KB
A Companion to Philosophical Logic || Fi
✍
Jacquette, Dale
📂
Article
📅
2006
🏛
Blackwell Publishing Ltd
🌐
English
⚖ 96 KB
👁 1 views
Edited By Dale Jacquette. Includes Bibliographical References And Index.
Logical quantizations of first-order str
✍
Hirokazu Nishimura
📂
Article
📅
1996
🏛
Springer
🌐
English
⚖ 981 KB
Every recursively enumerable extension o
✍
M. G. Peretyat'kin
📂
Article
📅
1973
🏛
Springer US
🌐
English
⚖ 351 KB
Fregean Extensions of First-Order Theori
✍
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