Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
97 | Peter Koepke, Ryan Siders |
Register computations on ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(6), pp. 529-548, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03D60, 03E45 |
76 | Philip D. Welch |
The Transfinite Action of 1 Tape Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 532-539, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Arnold Beckmann |
A Note on Universal Measures for Weak Implicit Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings, pp. 53-67, 2002, Springer, 3-540-00010-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic |
66 | Nicolas Bedon, Olivier Carton |
An Eilenberg Theorem for Words on Countable Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings, pp. 53-64, 1998, Springer, 3-540-64275-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
63 | M. Randall Holmes |
The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 79(3), pp. 357-372, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
double extension set theory, universal set, ordinals |
61 | Sébastien Konieczny |
Using Transfinite Ordinal Conditional Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 10th European Conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009. Proceedings, pp. 396-407, 2009, Springer, 978-3-642-02905-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
61 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
Higher-Order Termination: From Kruskal to Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 1-14, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
61 | Peter Koepke |
Computing a Model of Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 223-232, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
61 | Panagiotis Manolios, Daron Vroon 0001 |
Algorithms for Ordinal Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 243-257, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
57 | Harvey Friedman |
Some Decision Problems of Enormous Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 2-12, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
proof thoery, complexity, trees, hypergraphs, ordinals |
51 | Ariya Isihara |
Hydra Games and Tree Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings, pp. 238-247, 2007, Springer, 978-3-540-73443-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Stéphane Demri, Alexander Rabinovich |
The Complexity of Temporal Logic with Until and Since over Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 531-545, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Christian Choffrut |
Elementary Theory of Ordinals with Addition and Left Translation by omega. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers, pp. 15-20, 2001, Springer, 3-540-43453-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
46 | Harold Simmons |
Fruitful and helpful ordinal functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(7-8), pp. 677-709, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03E10 |
46 | Daniel W. Cunningham |
A covering lemma for K(\mathbb R). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(3-4), pp. 197-221, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03E45, 03E60 |
46 | Arnold Beckmann |
Dynamic ordinal analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(4), pp. 303-334, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Daniel W. Cunningham |
A covering lemma for L(R). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(1), pp. 49-54, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
42 | Toshiyasu Arai |
Proof theory for theories of ordinals - I: recursively Mahlo ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 122(1-3), pp. 1-85, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Alexander Rabinovich, Amit Shomrat |
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pillars of Computer Science ![In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp. 571-588, 2008, Springer, 978-3-540-78126-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Matt Kaufmann, Konrad Slind |
Proof Pearl: Wellfounded Induction on the Ordinals Up to epsilon 0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings, pp. 294-301, 2007, Springer, 978-3-540-74590-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Michael Rathjen |
Theories and Ordinals: Ordinal Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 632-637, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Benjamin R. George |
Second-Order Characterizable Cardinals and Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 84(3), pp. 425-449, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cardinal Characterizability, Ordinal Characterizability, Fraenkel-Carnap Question, Second-order Logic |
36 | Ali Enayat |
Models of set theory with definable ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(3), pp. 363-385, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Herman Ruge Jervell |
Finite Trees as Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 211-220, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Jeffry L. Hirst |
Reverse mathematics of prime factorization of ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(3), pp. 195-201, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
second-order arithmetic, reverse mathematics |
36 | Markus Marzetta, Thomas Strahm |
The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 37(5-6), pp. 391-413, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Nachum Dershowitz |
Trees, Ordinals and Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings, pp. 243-250, 1993, Springer, 3-540-56610-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Joel David Hamkins, Russell G. Miller |
Post's Problem for Ordinal Register Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 358-367, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ordinal computability, ordinal register machine, Post’s Problem, computability |
30 | Panos Rondogiannis, William W. Wadge |
Minimum model semantics for logic programs with negation-as-failure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(2), pp. 441-467, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
infinite-valued logics, Logic programming, well-founded model, negation-as-failure |
30 | Panagiotis Manolios, Daron Vroon 0001 |
Ordinal Arithmetic: Algorithms and Mechanization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 34(4), pp. 387-423, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
automated reasoning, arithmetic, ACL2, ordinal |
30 | Todd Eisworth, Saharon Shelah |
Successors of singular cardinals and coloring theorems I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(5), pp. 597-618, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Jonsson cardinals, coloring theorms, successors of singular cardinals |
30 | Harold Simmons |
A comparison of two systems of ordinal notations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(1), pp. 65-84, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Lev D. Beklemishev |
Proof-theoretic analysis by iterated reflection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(6), pp. 515-552, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Michael Möllerfeld, Michael Rathjen |
A note on the Sigma1 spectrum of a theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(1), pp. 33-34, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Panos Rondogiannis, William W. Wadge |
An Infinite-Valued Semantics for Logic Programs with Negation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings, pp. 456-467, 2002, Springer, 3-540-44190-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Krzysztof R. Apt, Gordon D. Plotkin |
Countable nondeterminism and random assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 33(4), pp. 724-767, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
27 | Andreas Weiermann |
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 488-498, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings |
27 | Christian Delhommé |
Height of a Superposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(2-3), pp. 221-233, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge-partition, natural product of ordinals, poset, height |
27 | Arthur W. Apter |
Some remarks on indestructibility and Hamkins' lottery preparation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(8), pp. 717-735, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Supercompact cardinal, Strongly compact cardinal, Strong cardinal, Lottery preparation, Indestructibility, Non-reflecting stationary set of ordinals |
27 | Nick Cropper, Ursula Martin |
The Classification of Polynomial Orderings on Monadic Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(3), pp. 197-226, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Termination, Term rewriting systems, Ordinals |
21 | Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov |
Generalized fusible numbers and their ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 175(Issue 1, Part A), pp. 103355, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Type-theoretic approaches to ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 957, pp. 113843, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Lior Shiboli, Gabriel Nivasch |
Ordinals and recursive algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.17210, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Set-Theoretic and Type-Theoretic Ordinals Coincide. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.10696, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Miha E. Habic, Radek Honzik |
Capturing sets of ordinals by normal ultrapowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(6), pp. 103261, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Set-Theoretic and Type-Theoretic Ordinals Coincide. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS, pp. 1-13, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Colcombet, Sam van Gool, Rémi Morvan |
First-order separation over countable ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.03089, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov |
Generalized fusible numbers and their ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.11017, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Type-Theoretic Approaches to Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.03844, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Colcombet, Sam van Gool, Rémi Morvan |
First-order separation over countable ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, pp. 264-284, 2022, Springer, 978-3-030-99252-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Jeffrey Bergfalk |
Dimensions of Ordinals: Set Theory, Homology Theory, and the First Omega Alephs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 27(4), pp. 526-527, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Dragan Masulovic, Branislav Sobot |
Countable Ordinals and Big Ramsey Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 41(3), pp. 425-446, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Connecting Constructive Notions of Ordinals in Homotopy Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.02549, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Juan P. Aguilera 0001 |
A characterization of Σ11-reflecting ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 172(10), pp. 103009, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Connecting Constructive Notions of Ordinals in Homotopy Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia., pp. 70:1-70:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-201-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud |
Degrees of categoricity above limit ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 9(2), pp. 127-137, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Peter H. Schmitt |
Two First-Order Theories of Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fields of Logic and Computation III ![In: Fields of Logic and Computation III - Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday, pp. 247-257, 2020, Springer, 978-3-030-48005-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Nikolay Bazhenov 0001, Stefan V. Vatev |
A Note on Computable Embeddings for Ordinals and Their Reverses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings, pp. 1-13, 2020, Springer, 978-3-030-51465-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Xing-Xian Zhang, Ying-Ming Wang 0001, Sheng-Qun Chen, Lei Chen 0059 |
An evidential reasoning based approach for GDM with uncertain preference ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 37(6), pp. 8357-8369, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Sanjay Jain 0001, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan 0001 |
The isomorphism problem for tree-automatic ordinals with addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 149, pp. 19-24, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Sebastian Koch |
Natural Addition of Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formaliz. Math. ![In: Formaliz. Math. 27(2), pp. 139-152, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Basil Lourié |
What Means 'Tri-' in 'Trinity'? An Eastern Patristic Approach to the 'Quasi-Ordinals'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 6(6), pp. 1093-1108, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Maria Hämeen-Anttila |
Nominalistic Ordinals, Recursion on Higher Types, and finitism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 25(1), pp. 101-124, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Victoria Gitman, Joel David Hamkins |
A model of the generic Vopěnka principle in which the ordinals are not Mahlo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 58(1-2), pp. 245-265, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Gian Carlo Milanese, Yde Venema |
Closure Ordinals of the Two-Way Modal µ-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings, pp. 498-515, 2019, Springer, 978-3-662-59532-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Anthony Lick |
A Hypersequent Calculus with Clusters for Data Logic over Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings, pp. 166-184, 2019, Springer, 978-3-030-29025-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ali Enayat, Joel David Hamkins |
Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 83(1), pp. 146-164, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Sanjay Jain 0001, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan 0001 |
The isomorphism problem for tree-automatic ordinals with addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.13153, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Alexis Bès, Christian Choffrut |
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.03028, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Feresiano Mwesigye, John Kenneth Truss |
Ehrenfeucht-Fraïssé games on ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 169(7), pp. 616-636, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Matthew Wright |
Degrees of relations on ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 7(4), pp. 349-365, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | David Baelde, Anthony Lick, Sylvain Schmitz |
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India, pp. 15:1-15:19, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-093-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Stephen Flood |
Ordinals and graph decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 168(4), pp. 824-839, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Anthony Bonato, Przemyslaw Gordinowicz, Gena Hahn |
Cops and Robbers ordinals of cop-win trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(5), pp. 951-956, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Georg Moser |
KBOs, ordinals, subrecursive hierarchies and all that. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 27(2), pp. 469-495, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Peter H. Schmitt |
A Mechanizable First-Order Theory of Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25-28, 2017, Proceedings, pp. 331-346, 2017, Springer, 978-3-319-66901-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel |
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK, pp. 11:1-11:18, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-047-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Jacob Hilton |
The Topological Pigeonhole Principle for Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 81(2), pp. 662-686, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel |
Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2016, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Zhen Zhang 0002, Chonghui Guo |
A VIKOR-Based Approach to Group Decision Making With Uncertain Preference Ordinals and Incomplete Weight Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica ![In: Informatica 27(3), pp. 689-708, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Myung-Duk Hong, Kyeong-Jin Oh, Seung-Hyun Go, GeunSik Jo |
Temporal Ontology Representation and Reasoning Using Ordinals and Sets for Historical Events. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIIDS (1) ![In: Intelligent Information and Database Systems - 8th Asian Conference, ACIIDS 2016, Da Nang, Vietnam, March 14-16, 2016, Proceedings, Part I, pp. 75-85, 2016, Springer, 978-3-662-49380-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Arno Pauly |
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.00386, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
21 | Aaron Hunter 0001 |
Infinite Ordinals and Finite Improvement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LORI ![In: Logic, Rationality, and Interaction - 5th International Workshop, LORI 2015 Taipei, Taiwan, October 28-31, 2015, Proceedings, pp. 416-420, 2015, Springer, 978-3-662-48560-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Sourav Tarafder |
Ordinals in an Algebra-Valued Model of a Paraconsistent Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLA ![In: Logic and Its Applications - 6th Indian Conference, ICLA 2015, Mumbai, India, January 8-10, 2015. Proceedings, pp. 195-206, 2015, Springer, 978-3-662-45823-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Arno Pauly |
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (1) ![In: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I, pp. 407-418, 2015, Springer, 978-3-662-48056-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Toshiyasu Arai |
Lifting Proof Theory to the Countable Ordinals: Zermelo-Fraenkel Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 79(2), pp. 325-354, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Claude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia |
Pairs of orthogonal countable ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 335, pp. 35-44, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Olivier Finkel, Stevo Todorcevic |
Automatic Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Unconv. Comput. ![In: Int. J. Unconv. Comput. 9(1-2), pp. 61-70, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Andreas Weiermann, Gunnar Wilken |
Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 164(12), pp. 1493-1506, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Philipp Schlicht, Frank Stephan 0001 |
Automata on ordinals and automaticity of linear orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 164(5), pp. 523-527, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Martin Huschenbett, Jiamou Liu |
A Polychromatic Ramsey Theory for Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, pp. 559-570, 2013, Springer, 978-3-642-40312-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Michael Norrish, Brian Huffman |
Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings, pp. 133-146, 2013, Springer, 978-3-642-39633-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon |
Local Computability for Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings, pp. 161-170, 2013, Springer, 978-3-642-39052-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Tim Fischbach, Benjamin Seyfferth |
On λ-Definable Functions on Ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings, pp. 135-146, 2013, Springer, 978-3-642-39052-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Bahareh Afshari, Graham E. Leigh |
On closure ordinals for the modal mu-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy, pp. 30-44, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-60-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Franck van Breugel |
On behavioural pseudometrics and closure ordinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 112(19), pp. 715-718, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Olivier Finkel, Stevo Todorcevic |
Automatic Ordinals ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1205.1775, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
21 | Michiel De Smet, Andreas Weiermann |
Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 163(6), pp. 669-680, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Sarah Winkler, Harald Zankl, Aart Middeldorp |
Ordinals and Knuth-Bendix Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Mérida, Venezuela, March 11-15, 2012. Proceedings, pp. 420-434, 2012, Springer, 978-3-642-28716-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Weiermann, Alan R. Woods |
Some Natural Zero One Laws for Ordinals Below ε 0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, pp. 723-732, 2012, Springer, 978-3-642-30869-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|