×

Found 96 Documents (Results 1–96)

100
MathJax

Computable quotient presentations of models of arithmetic and set theory. (English) Zbl 06820466

Kennedy, Juliette (ed.) et al., Logic, language, information, and computation. 24th international workshop, WoLLIC 2017, London, UK, July 18–21, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10388, 140-152 (2017).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

Open determinacy for class games. (English) Zbl 1423.03200

Caicedo, Andrés Eduardo (ed.) et al., Foundations of mathematics. Logic at Harvard. Essays in honor of W. Hugh Woodin’s 60th birthday. Proceedings of the Logic at Harvard conference, Harvard University, Cambridge, MA, USA, March 27–29, 2015. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 690, 121-143 (2017).
MSC:  03E60 03E30 03C62
PDF BibTeX XML Cite
Full Text: DOI arXiv

The foundation axiom and elementary self-embeddings of the universe. (English) Zbl 1358.03070

Geschke, Stefan (ed.) et al., Infinity, computability and metamathematics. Festschrift celebrating the 60th birthdays of Peter Koepke and Philip Welch. London: College Publications (ISBN 978-1-84890-130-8/hbk). 89-112 (2014).
MSC:  03E30 03E70 03E45
PDF BibTeX XML Cite
Full Text: arXiv

A multiverse perspective on the axiom of constructibility. (English) Zbl 1321.03061

Chong, Chitat (ed.) et al., Infinity and truth. Based on talks given at the workshop, Singapore, July 25–29, 2011. Hackensack, NJ: World Scientific (ISBN 978-981-4571-03-6/hbk; 978-981-4571-05-0/ebook). Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore 25, 25-45 (2014).
MSC:  03E45
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals. (English) Zbl 1329.03075

Greenberg, Noam (ed.) et al., Effective mathematics of the uncountable. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-01451-0/hbk; 978-1-139-02859-2/ebook). Lecture Notes in Logic 41, 33-49 (2013).
PDF BibTeX XML Cite
Full Text: arXiv

Introduction. (English) Zbl 1369.03113

Greenberg, Noam (ed.) et al., Effective mathematics of the uncountable. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-01451-0/hbk; 978-1-139-02859-2/ebook). Lecture Notes in Logic 41, 1-13 (2013).
MSC:  03C57
PDF BibTeX XML Cite

Moving up and down in the generic multiverse. (English) Zbl 1303.03078

Lodaya, Kamal (ed.), Logic and its applications. 5th Indian conference, ICLA 2013, Chennai, India, January 10–12, 2013, Proceedings. Berlin: Springer (ISBN 978-3-642-36038-1/pbk). Lecture Notes in Computer Science 7750, 139-147 (2013).
MSC:  03E40 03B45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Effective mathematics of the uncountable. (English) Zbl 1297.03006

Lecture Notes in Logic 41. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-01451-0/hbk; 978-1-139-02859-2/ebook). viii, 197 p. (2013).
PDF BibTeX XML Cite
Full Text: DOI

The mate-in-\(n\) problem of infinite chess is decidable. (English) Zbl 1357.03042

Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 78-88 (2012).
MSC:  03B25 91A05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Some second order set theory. (English) Zbl 1209.03045

Ramanujam, R. (ed.) et al., Logic and its applications. Third Indian conference, ICLA 2009, Chennai, India, January 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-92700-6/pbk). Lecture Notes in Computer Science 5378. Lecture Notes in Artificial Intelligence, 36-50 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Infinite time computable model theory. (English) Zbl 1149.03024

Cooper, S. Barry (ed.) et al., New computational paradigms. Changing conceptions of what is computable. New York, NY: Springer (ISBN 978-0-387-36033-1/hbk). 521-557 (2008).
MSC:  03C57 03D60 03E35
PDF BibTeX XML Cite
Full Text: arXiv

A survey of infinite time Turing machines. (English) Zbl 1211.03060

Durand-Lose, Jérôme (ed.) et al., Machines, computations, and universality. 5th international conference, MCU 2007, Orléans, France, September 10–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74592-1/pbk). Lecture Notes in Computer Science 4664, 62-71 (2007).
MSC:  03D10 68Q05
PDF BibTeX XML Cite
Full Text: DOI

The complexity of quickly ORM-decidable sets. (English) Zbl 1150.03321

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 488-496 (2007).
MSC:  03D60 03D10 03D55
PDF BibTeX XML Cite
Full Text: DOI Link

Post’s problem for ordinal register machines. (English) Zbl 1151.03339

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 358-367 (2007).
MSC:  03D60 03D10
PDF BibTeX XML Cite
Full Text: DOI Link

Infinitary computability with infinite time Turing machines. (English) Zbl 1113.68399

Cooper, S. Barry (ed.) et al., New computational paradigms. First conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8–12, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26179-6/pbk). Lecture Notes in Computer Science 3526, 180-187 (2005).
MSC:  68Q05 03D10 68Q15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

Software