CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MUNCHHAUSEN

被引:11
作者
Visser, Albert [1 ]
机构
[1] Univ Utrecht, Dept Philosophy, NL-3584 CS Utrecht, Netherlands
关键词
DECIDABILITY; SUCCESSOR; LATTICE;
D O I
10.1017/S1755020309090261
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we show how to interpret Robinson's arithmetic Q and the theory R of Tarski, Mostowski, and Robinson as theories of cardinals in very weak theories of relations over a domain.
引用
收藏
页码:570 / 589
页数:20
相关论文
共 22 条
[1]  
[Anonymous], 1961, Transactions of the American Mathematical Society, DOI [DOI 10.1090/S0002-9947-1961-0139530-9, 10.1090/S0002-9947-1961-0139530-9]
[2]  
[Anonymous], 1960, Z. Math. Logik Grundlagen Math.
[3]  
[Anonymous], MEMOIRS AM MATH SOC
[4]  
[Anonymous], 1953, Undecidable Theories
[5]  
[Anonymous], 2005, PRINCETON MONOGRAPHS
[6]  
[Anonymous], DECIDABLE PAIR UNPUB
[7]  
BUCHI JR, 1959, AM MATH SOC NOTICES, V5, P834
[8]   Decidability of the theory of the natural integers with the cantor pairing function and the successor [J].
Cegielski, P ;
Richard, D .
THEORETICAL COMPUTER SCIENCE, 2001, 257 (1-2) :51-77
[9]  
Collins GE., 1970, Notre Dame J. Form. Logic, V11, P477
[10]   DECIDABILITY AND UNDECIDABILITY OF EXTENSIONS OF 2ND (1ST) ORDER THEORY OF (GENERALIZED) SUCCESSOR [J].
ELGOT, CC ;
RABIN, MO .
JOURNAL OF SYMBOLIC LOGIC, 1966, 31 (02) :169-&