Bases for Structures and Theories I
暂无分享,去创建一个
[1] W. V. Quine,et al. Concatenation as a basis for arithmetic , 1946, Journal of Symbolic Logic.
[2] George Boolos,et al. Computability and logic , 1974 .
[3] David W. Miller. POPPER'S QUALITATIVE THEORY OF VERISIMILITUDE , 1974, The British Journal for the Philosophy of Science.
[4] Richard Kaye,et al. On Interpretations of Arithmetic and Set Theory , 2007, Notre Dame J. Formal Log..
[5] T. Schindler,et al. Arithmetic with Fusions , 2016 .
[6] Albert Visser,et al. When Bi-Interpretability Implies Synonymy , 2014 .
[7] Vítezslav Svejdar. On Interpretability in the Theory of Concatenation , 2009, Notre Dame J. Formal Log..
[8] K. L. De Bouvère. Logical Synonymity**Paper prepared at the University of Amsterdam under Euratom Contract No. 034–64–1 CET N. The author is grateful to Professors Stig Kanger, Richard Montague and Dana Scott for valuable discussions and suggestions. , 1965 .
[9] Albert Visser. Growing Commas. A Study of Sequentiality and Concatenation , 2009, Notre Dame J. Formal Log..
[10] Mihai Ganea,et al. Arithmetic on semigroups , 2009, The Journal of Symbolic Logic.
[11] A. Grzegorczyk,et al. Undecidability and Concatenation , 2007 .
[12] Albert Visser,et al. The Interpretability of Inconsistency: Feferman's Theorem and Related Results , 2014 .
[13] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .
[14] Andrzej Grzegorczyk. Undecidability without Arithmetization , 2005, Stud Logica.
[15] David W. Miller,et al. The accuracy of predictions , 1975, Synthese.
[16] Albert Visser. Extension and Interpretability , 2015 .
[17] I. Németi,et al. Mutual definability does not imply definitional equivalence, a simple example , 2005, Math. Log. Q..
[18] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .
[19] George Boolos,et al. Computability and logic: 3rd ed. , 1989 .
[20] N. Goodman. Fact, Fiction, and Forecast , 1955 .
[21] David W. Miller. The distance between constituents , 1978, Synthese.