메뉴 건너뛰기




Volumn 171, Issue 3, 2002, Pages 197-211

Decidability and definability results related to the elementary theory of ordinal multiplication

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0036037619     PISSN: 00162736     EISSN: None     Source Type: Journal    
DOI: 10.4064/fm171-3-1     Document Type: Article
Times cited : (7)

References (19)
  • 3
    • 0003162815 scopus 로고
    • Théorie élémentaire de la multiplication des entiers naturels
    • Model Theory and Arithmetic (Paris, 1979/80), Springer
    • (1981) Lecture Notes in Math. , vol.890 , pp. 44-89
    • Cegielski, P.1
  • 5
    • 0000918436 scopus 로고
    • An application of games to the completeness problem for formalized theories
    • (1961) Fund. Math. , vol.49 , pp. 129-141
    • Ehrenfeucht, A.1
  • 11
    • 0001699148 scopus 로고
    • Recursive unsolvability of post's problem of "tag" and other topics in theory of Turing machines
    • (1961) Ann. of Math. , vol.74 , pp. 437-455
    • Minsky, M.L.1
  • 14
    • 0005274623 scopus 로고
    • On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
    • transl. by D. Jacquette
    • (1991) Hist. Philos. Logic , vol.12 , pp. 225-233
    • Presburger, M.1
  • 19
    • 0005317761 scopus 로고    scopus 로고
    • On the work of Andrzej Ehrenfeucht in model theory
    • Structures in Logic and Computer Science. A Selection of Essays in Honor of Andrzej Ehrenfeucht (J. Mycielski, ed.), Springer
    • (1997) Lecture Notes in Comput. Sci. , vol.1261 , pp. 1-13
    • Vaught, R.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.