

Reviews for
Zentralblatt MATH (zbMATH)
 Zbl 07326440
Kurahashi, Taishi (2020); A note on derivability conditions, J. Symb. Log. 85, 12241253.
 Zbl 07335864
Cheng, Yong (2020); Finding the limit of incompleteness. I, Bull. Symb. Log. 26, No. 34, 268286.
 Zbl 07243253
von Plato, Jan (2020); Can mathematics be proved consistent? Gödel's shorthand notes & lectures on incompleteness, Sources and Studies in the History of Mathematics and Physical Sciences. Cham: Springer (ISBN 9783030508753/hbk; 9783030508760/ebook). ix, 263 p.
 Zbl 1456.03091
Montalban, Antonio; Walsh, James (2019); On the inevitability of the consistency operator, J. Symb. Log. 84, No. 1, 205225.
 Zbl 1454.03015
Utreras, Javier (2019); Interpreting arithmetic in the firstorder theory of addition and coprimality of polynomial rings, J. Symb. Log. 84, No. 3, 11941214.
 Zbl 1454.03079
Konovalov, A. Yu. (2019); Generalized realizability for extensions of the language of arithmetic, Mosc. Univ. Math. Bull. 74, No. 4, 167170. Translation from Vestn. Mosk. Univ., Ser. I 74, No. 4, 5054.
 Zbl 1446.03029
Hieronymi, Philipp (2019); When is scalar multiplication decidable?, Ann. Pure Appl. Logic 170, No. 10, 11621175.
 Zbl 1458.11171
Koenigsmann, Jochen (2018); Decidability in local and global fields, in: Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians, ICM 2018, Rio de Janeiro, Brazil, August 19, 2018. Volume II. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 4559.
 Zbl 1446.03102
Kurahashi, Taishi (2018); On partial disjunction properties of theories containing Peano arithmetic, Arch. Math. Logic 57, No. 78, 953980.
 Zbl 1412.03019
Halava, Vesa; Harju, Tero; Sahla, Esa (2018); On fixed points of rational transductions, Theor. Comput. Sci. 732, 8588.
 Zbl 1426.03037
Li, Fu; Tzameret, Iddo; Wang, Zhengyu (2018); Characterizing propositional proofs as noncommutative formulas, SIAM J. Comput. 47, No. 4, 14241462.
 Zbl 1426.03038
Kikuchi, Makoto; Kurahashi, Taishi (2017); Generalizations of Godel's incompleteness theorems for Sigma_ndefinable theories of arithmetic, Rev. Symb. Log. 10, No. 4, 603616.
 Zbl 1404.03016
Freund, Max A. (2016); Predication and computable concepts, Log. Anal., Nouv. Ser. 59, No. 234, 133155.
 Zbl 1350.68173
Idziaszek, Tomasz; Skrzypczak, Michal; Bojanczyk, Mikolaj (2016); Regular languages of thin trees, Theory Comput. Syst. 58, No. 4, 614663.
 Zbl 1343.03045
Japaridze, Giorgi (2016); Introduction to clarithmetic. II, Inf. Comput. 247, 290312.
 Zbl 1339.03014
Kufleitner, Manfred; Walter, Tobias (2015); One quantifier alternation in firstorder logic with modular predicates, RAIRO, Theor. Inform. Appl. 49, No. 1, 122.
 Zbl 1319.68138
Maletti, Andreas (2015); Hyperoptimization for deterministic tree automata, Theor. Comput. Sci. 578, 7287.
 Zbl 1303.03089
Japaridze, Giorgi (2014); Introduction to clarithmetic. III, Ann. Pure Appl. Logic 165, No. 1, 241252.
 Zbl 1391.20003
Lohrey, Markus (2014); The compressed word problem for groups, SpringerBriefs in Mathematics. New York, NY: Springer (ISBN 9781493907472/pbk; 9781493907489/ebook). xii, 153 p.
 Zbl 1270.03002
Smith, Peter (2013); An introduction to Godel's theorems Cambridge Introductions to Philosophy. Cambridge: Cambridge University Press (ISBN 9781107606753/pbk; 9781107022843/hbk). xvi, 388 p.
 Zbl 1295.68121
Bova, Simone; Chen, Hubie; Valeriote, Matthew (2013); Generic expression hardness results for primitive positive formula comparison, Inf. Comput. 222, 108120.
 Zbl 1306.08004
Steinby, Magnus (2012); On the solidity of general varieties of tree languages, Discuss. Math., Gen. Algebra Appl. 32, 2353.
 Zbl 1301.03063
FernandezDuque, David; Joosten, Joost J. (2012); Kripke models of transfinite provability logic,
in: Bolander, Thomas (ed.) et al., Advances in modal logic. Vol. 9. Proceedings of the 9th conference (AiML 2012), Copenhagen, Denmark, August 2225, 2012. London: College Publications (ISBN 9781848900684/pbk). 185199
 Zbl 1282.03023
Dantchev, Stefan; Martin, Barnaby (2012); Cutting planes and the parameter cutwidth, Theory Comput. Syst. 51, No. 1, 5064.
 Zbl 1260.08001
Esik, Z.; Kuich, W. (2012); Free iterative and iteration Ksemialgebras,Algebra Univers. 67, No. 2, 141162.
 Zbl 1257.03088
Kikuchi, Makoto; Kurahashi, Taishi; Sakai, Hiroshi (2012); On proofs of the incompleteness theorems based on Berry's paradox by Vopenka, Chaitin, and Boolos, Math. Log. Q. 58, No. 45, 307316.
 Zbl 1257.68006
Courcelle, Bruno; Engelfriet, Joost (2012); Graph structure and monadic secondorder logic. A languagetheoretic approach, Encyclopedia of Mathematics and its Applications 138. Cambridge: Cambridge University Press (ISBN 9780521898331/hbk). xiv, 728 p.
 Zbl 1244.68047
Fratani, Severine (2012); Regular sets over extended tree structures, Theor. Comput. Sci. 418, 4870.
 Zbl 1288.03003
Macintyre, Angus (2011); The impact of Godel's incompleteness theorems on mathematics,
in: Baaz, Matthias (ed.) et al., Kurt Godel and the foundations of mathematics. Horizons of truth. Cambridge: Cambridge University Press (ISBN 9780521761444/hbk). 325
 Zbl 1291.03079
Morozov, A. S. (2011); On some representations of the real number field, Algebra Logic 50, No. 2, 189190. Translation from Algebra Logika 50, No. 2, 270271.
 Zbl 1282.03024
Sereny, Gyorgy (2011); How do we know that the Godel sentence of a consistent theory is true?, Philos. Math. (3) 19, No. 1, 4773.
 Zbl 1262.03123
Visser, Albert (2011); Can we make the second incompleteness theorem coordinate free?, J. Log. Comput. 21, No. 4, 543560.
 Zbl 1257.03087
Jerabek, Emil (2011); A sorting network in bounded arithmetic, Ann. Pure Appl. Logic 162, No. 4, 341355.
 Zbl 1243.03075
Japaridze, Giorgi (2011); Introduction to clarithmetic. I, Inf. Comput. 209, No. 10, 13121354.
 Zbl 1244.68046
Esik, Zoltan; Maletti, Andreas (2011); The category of simulations for weighted tree automata, Int. J. Found. Comput. Sci. 22, No. 8, 18451859.
 Zbl 1231.03053
Kitada, Hitoshi (2011); Rebuttal to the review of my paper "An implication of Godel's incompleteness theorem" appeared in Zentralblatt fur Mathematik, Int. J. Pure Appl. Math. 70, No. 1, 1114.
 Zbl 1236.08014
Mucka, Anna (2011); Subdirectly irreducible fibered automata. II, Demonstr. Math. 44, No. 1, 115.
 Zbl 1237.68117
Moura, Ana (2011); The word problem for omegaterms over DA, Theor. Comput. Sci. 412, No. 46, 65566569.
 Zbl 1235.68106
Haubold, Niko; Lohrey, Markus (2011); Compressed word problems in HNNextensions and amalgamated products, Theory Comput. Syst. 49, No. 2, 283305.
 Zbl 1235.11114
Utreras, Javier (2011); A logical approach to the problem of representation of integers by systems of diagonal forms, Bull. Lond. Math. Soc. 43, No. 2, 299310.
 Zbl 1227.68079
Hofner, Peter; Moller, Bernhard (2011); Fixing Zeno gaps, Theor. Comput. Sci. 412, No. 28, 33033322.
 Zbl 1227.68041
Endrullis, Jorg; Grabmayer, Clemens; Klop, Jan Willem; van Oostrom, Vincent (2011); On equal muterms, Theor. Comput. Sci. 412, No. 28, 31753202.
 Zbl 1220.68067
Fulop, Zoltan; Steinby, Magnus (2011); Varieties of recognizable tree series over fields, Theor. Comput. Sci. 412, No. 810, 736752.
 Zbl 1236.08015
Mucka, Anna (2010); Subdirectly irreducible fibered automata, Demonstr. Math. 43, No. 4, 739753.
 Zbl 1217.03045
Chubaryan, Anahit (2010); Rabin style speedup of proofs. More generalized speedup in the systems of first order logic Saarbrucken: LAP Lambert Academic Publishing (ISBN 9783843372558). 52 p.
 Zbl 1205.03064
Hetzl, Stefan (2010); On the form of witness terms, Arch. Math. Logic 49, No. 5, 529554.
 Zbl 1201.03055
Japaridze, Giorgi (2010); Towards applied theories based on computability logic, J. Symb. Log. 75, No. 2, 565601.
 Zbl 1201.03050
Chen, Yijia; Flum, Jorg (2010); On the complexity of Godel's proof predicate, J. Symb. Log. 75, No. 1, 239254.
 Zbl 1191.03044
Willard, Dan E. (2009); Some specially formulated axiomizations for ISigma_0 manage to evade the Herbrandized version of the second incompleteness theorem, Inf. Comput. 207, No. 10, 10781093.
 Zbl 1186.03072
Kitada, Hitoshi (2009); An implication of Godel's incompleteness theorem, Int. J. Pure Appl. Math. 52, No. 4, 511567.
 Zbl 1173.03043
Cavagnetto, Stefano (2009); String rewriting and proof complexity: an interpretation of resolution, Rep. Math. Logic 44, 167200.
 Zbl 1222.11147
Shlapentokh, Alexandra (2008); Elliptic curves retaining their rank in finite extensions and Hilbert's tenth problem for rings of algebraic numbers, Trans. Am. Math. Soc. 360, No. 7, 35413555.
 Zbl 1170.03019
Bojanczyk, Mikolaj; Segoufin, Luc (2008); Tree languages defined in firstorder logic with one quantifier alternation, in: Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 711, 2008. Proceedings, Part II. Berlin: Springer (ISBN 9783540705826/pbk). Lecture Notes in Computer Science 5126, 233245.
 Zbl 1168.03044
Pudlak, Pavel (2008); Fragments of bounded arithmetic and the lengths of proofs, J. Symb. Log. 73, No. 4, 13891406.
 Zbl 1170.03028
Japaridze, Giorgi (2008); Cirquent calculus deepened, J. Log. Comput. 18, No. 6, 9831028.
 Zbl 1153.11061
Cegielski, Patrick; Richard, Denis; Vsemirnov, Maxim (2007); On the additive theory of prime numbers, Fundam. Inform. 81, No. 13, 8396.
 Zbl 1154.03002
Smith, Peter (2008); An introduction to Godel's theorems, Cambridge Introductions to Philosophy. Cambridge: Cambridge University Press (ISBN 9780521674539/pbk; 9780521857840/hbk). xiv, 361 p.
 Zbl 1150.03002
Friedman, Harvey M. (2008); Remarks on Godel phenomena and the field of reals, in: Ehrenfeucht, A. (ed.) et al., Andrzej Mostowski and foundational studies, Amsterdam: IOS Press (ISBN 9781586037826/hbk). 6871.
 Zbl 1148.03037
Naumov, Pavel (2008); On meta complexity of propositional formulas and propositional proofs, Arch. Math. Logic 47, No. 1, 3552.
 Zbl 1144.03035
Schwichtenberg, Helmut (2008); Dialectica interpretation of wellfounded induction, Math. Log. Q. 54, No. 3, 229239.
 Zbl 1146.03038
Restall, Greg (2008); Proofnets for S5: sequents and circuits for modal logic, in: Dimitracopoulos, Costas (ed.) et al., Logic colloquium 2005. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Athens, Greece, July 28August 3, 2005. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 9780521884259/hbk). Lecture Notes in Logic 28, 151172.
 Zbl 1137.03032
Sirokofskich, A.; Dimitracopoulos, C. (2007); On a problem of J. Paris, J. Log. Comput. 17, No. 6, 10991107.
 Zbl 1131.03030
Brunnler, Kai (2006); Locality for classical logic, Notre Dame J. Formal Logic 47, No. 4, 557580.
 Zbl 1107.08005
Denecke, K.; Glubudom, P. (2006); Generalized power Menger algebras and generalized nondeterministic hypersubstitutions, in: Dorfer, G. (ed.) et al., Proceedings of the 70th workshop on general algebra "70. Arbeitstagung Allgemeine Algebra", Vienna, Austria, May 2629, 2005. Klagenfurt: Verlag Johannes Heyn (ISBN 3708401948/pbk). Contributions to General Algebra 17, 6170.
 Zbl 1104.03012
Naumov, Pavel (2006); On modal logic of deductive closure, Ann. Pure Appl. Logic 141, No. 12, 218224.
 Zbl 1105.03057
Ciabattoni, Agata; Terui, Kazushige (2006); Towards a semantic characterization of cutelimination, Stud. Log. 82, No. 1, 95119.
 Zbl 1103.08003
Petkovic, T.; Cirid, M.; Bogdanovic, S. (2006); On correspondences between unary algebras, automata, semigroups and congruences, Algebra Colloq. 13, No. 3, 495506.
 Zbl 1092.68060
Steinby, Magnus (2005); Algebraic classifications of regular tree languages, in: Kudryavtsev, Valery B. et al. (eds.), Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 718, 2003. Dordrecht: Kluwer Academic Publishers (ISBN 1402038151/hbk; 1402038178/ebook). NATO Science Series II: Mathematics, Physics and Chemistry 207, 381432.
 Zbl 1092.68057
Dassow, Jurgen (2005); Completeness of automaton mappings with respect to equivalence relations, in: Kudryavtsev, Valery B. et al. (eds.), Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 718, 2003. Dordrecht: Kluwer Academic Publishers (ISBN 1402038151/hbk; 1402038178/ebook). NATO Science Series II: Mathematics, Physics and Chemistry 207, 77108.
 Zbl 1086.03045
Negri, Sara (2005); Proof analysis in modal logic, J. Philos. Log. 34, No. 56, 507544.
 Zbl 1087.03037
Beklemishev, Lev D.; Visser, Albert (2005); On the limit existence principles in elementary arithmetic and Sigma_{n}^{0}consequences of theories, Ann. Pure Appl. Logic 136, No. 12, 5674.
 Zbl 1084.03046
D'Aquino, Paola (2005); Weak fragments of Peano arithmetic, in: Cholak, Peter (ed.), The Notre Dame lectures. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ISBN 1568812493/hbk; 1568812507/pbk). Lecture Notes in Logic 18, 149185.
 Zbl 1060.03032
Crabbe, Marcel (2004); On the notion of substitution, Log. J. IGPL 12, No. 2, 111124.
 Zbl 1051.03050
Baillot, Patrick (2004); Stratified coherence spaces: A denotational semantics for light linear logic, Theor. Comput. Sci. 318, No. 12, 2955.
Back ☚


 