The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Ordinals with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1938-1973 (15) 1974-1979 (15) 1980-1986 (19) 1987-1994 (16) 1995-1999 (21) 2000-2002 (21) 2003-2005 (28) 2006-2007 (21) 2008-2010 (20) 2011-2013 (16) 2014-2017 (15) 2018-2020 (17) 2021-2024 (15)
Publication types (Num. hits)
article(165) inproceedings(72) phdthesis(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 35 occurrences of 30 keywords

Results
Found 239 publication records. Showing 239 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
97Peter Koepke, Ryan Siders Register computations on ordinals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D60, 03E45
76Philip D. Welch The Transfinite Action of 1 Tape Turing Machines. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Arnold Beckmann A Note on Universal Measures for Weak Implicit Computational Complexity. Search on Bibsonomy LPAR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
66Nicolas Bedon, Olivier Carton An Eilenberg Theorem for Words on Countable Ordinals. Search on Bibsonomy LATIN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
63M. Randall Holmes The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory. Search on Bibsonomy Stud Logica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF double extension set theory, universal set, ordinals
61Sébastien Konieczny Using Transfinite Ordinal Conditional Functions. Search on Bibsonomy ECSQARU The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
61Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio Higher-Order Termination: From Kruskal to Computability. Search on Bibsonomy LPAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
61Peter Koepke Computing a Model of Set Theory. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
61Panagiotis Manolios, Daron Vroon 0001 Algorithms for Ordinal Arithmetic. Search on Bibsonomy CADE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
57Harvey Friedman Some Decision Problems of Enormous Complexity. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF proof thoery, complexity, trees, hypergraphs, ordinals
51Ariya Isihara Hydra Games and Tree Ordinals. Search on Bibsonomy WoLLIC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
51Stéphane Demri, Alexander Rabinovich The Complexity of Temporal Logic with Until and Since over Ordinals. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
51Christian Choffrut Elementary Theory of Ordinals with Addition and Left Translation by omega. Search on Bibsonomy Developments in Language Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
46Harold Simmons Fruitful and helpful ordinal functions. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03E10
46Daniel W. Cunningham A covering lemma for K(\mathbb R). Search on Bibsonomy Arch. Math. Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03E45, 03E60
46Arnold Beckmann Dynamic ordinal analysis. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Daniel W. Cunningham A covering lemma for L(R). Search on Bibsonomy Arch. Math. Log. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
42Toshiyasu Arai Proof theory for theories of ordinals - I: recursively Mahlo ordinals. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
36Alexander Rabinovich, Amit Shomrat Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. Search on Bibsonomy Pillars of Computer Science The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Matt Kaufmann, Konrad Slind Proof Pearl: Wellfounded Induction on the Ordinals Up to epsilon 0. Search on Bibsonomy TPHOLs The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Michael Rathjen Theories and Ordinals: Ordinal Analysis. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Benjamin R. George Second-Order Characterizable Cardinals and Ordinals. Search on Bibsonomy Stud Logica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Cardinal Characterizability, Ordinal Characterizability, Fraenkel-Carnap Question, Second-order Logic
36Ali Enayat Models of set theory with definable ordinals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Herman Ruge Jervell Finite Trees as Ordinals. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Jeffry L. Hirst Reverse mathematics of prime factorization of ordinals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF second-order arithmetic, reverse mathematics
36Markus Marzetta, Thomas Strahm The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
36Nachum Dershowitz Trees, Ordinals and Termination. Search on Bibsonomy TAPSOFT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
30Joel David Hamkins, Russell G. Miller Post's Problem for Ordinal Register Machines. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF ordinal computability, ordinal register machine, Post’s Problem, computability
30Panos Rondogiannis, William W. Wadge Minimum model semantics for logic programs with negation-as-failure. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF infinite-valued logics, Logic programming, well-founded model, negation-as-failure
30Panagiotis Manolios, Daron Vroon 0001 Ordinal Arithmetic: Algorithms and Mechanization. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF automated reasoning, arithmetic, ACL2, ordinal
30Todd Eisworth, Saharon Shelah Successors of singular cardinals and coloring theorems I. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Jonsson cardinals, coloring theorms, successors of singular cardinals
30Harold Simmons A comparison of two systems of ordinal notations. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Lev D. Beklemishev Proof-theoretic analysis by iterated reflection. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Michael Möllerfeld, Michael Rathjen A note on the Sigma1 spectrum of a theory. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
30Panos Rondogiannis, William W. Wadge An Infinite-Valued Semantics for Logic Programs with Negation. Search on Bibsonomy JELIA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
30Krzysztof R. Apt, Gordon D. Plotkin Countable nondeterminism and random assignment. Search on Bibsonomy J. ACM The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
27Andreas Weiermann A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings
27Christian Delhommé Height of a Superposition. Search on Bibsonomy Order The full citation details ... 2006 DBLP  DOI  BibTeX  RDF edge-partition, natural product of ordinals, poset, height
27Arthur W. Apter Some remarks on indestructibility and Hamkins' lottery preparation. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Supercompact cardinal, Strongly compact cardinal, Strong cardinal, Lottery preparation, Indestructibility, Non-reflecting stationary set of ordinals
27Nick Cropper, Ursula Martin The Classification of Polynomial Orderings on Monadic Terms. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Termination, Term rewriting systems, Ordinals
21Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov Generalized fusible numbers and their ordinals. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Type-theoretic approaches to ordinals. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Lior Shiboli, Gabriel Nivasch Ordinals and recursive algorithms. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Set-Theoretic and Type-Theoretic Ordinals Coincide. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Miha E. Habic, Radek Honzik Capturing sets of ordinals by normal ultrapowers. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Set-Theoretic and Type-Theoretic Ordinals Coincide. Search on Bibsonomy LICS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Thomas Colcombet, Sam van Gool, Rémi Morvan First-order separation over countable ordinals. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
21Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov Generalized fusible numbers and their ordinals. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Type-Theoretic Approaches to Ordinals. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Thomas Colcombet, Sam van Gool, Rémi Morvan First-order separation over countable ordinals. Search on Bibsonomy FoSSaCS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Jeffrey Bergfalk Dimensions of Ordinals: Set Theory, Homology Theory, and the First Omega Alephs. Search on Bibsonomy Bull. Symb. Log. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Dragan Masulovic, Branislav Sobot Countable Ordinals and Big Ramsey Degrees. Search on Bibsonomy Comb. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Connecting Constructive Notions of Ordinals in Homotopy Type Theory. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Juan P. Aguilera 0001 A characterization of Σ11-reflecting ordinals. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Connecting Constructive Notions of Ordinals in Homotopy Type Theory. Search on Bibsonomy MFCS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud Degrees of categoricity above limit ordinals. Search on Bibsonomy Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Peter H. Schmitt Two First-Order Theories of Ordinals. Search on Bibsonomy Fields of Logic and Computation III The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Nikolay Bazhenov 0001, Stefan V. Vatev A Note on Computable Embeddings for Ordinals and Their Reverses. Search on Bibsonomy CiE The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Xing-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 J. Intell. Fuzzy Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Sanjay Jain 0001, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan 0001 The isomorphism problem for tree-automatic ordinals with addition. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Sebastian Koch Natural Addition of Ordinals. Search on Bibsonomy Formaliz. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Basil Lourié What Means 'Tri-' in 'Trinity'? An Eastern Patristic Approach to the 'Quasi-Ordinals'. Search on Bibsonomy FLAP The full citation details ... 2019 DBLP  BibTeX  RDF
21Maria Hämeen-Anttila Nominalistic Ordinals, Recursion on Higher Types, and finitism. Search on Bibsonomy Bull. Symb. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Victoria Gitman, Joel David Hamkins A model of the generic Vopěnka principle in which the ordinals are not Mahlo. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Gian Carlo Milanese, Yde Venema Closure Ordinals of the Two-Way Modal µ-Calculus. Search on Bibsonomy WoLLIC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Anthony Lick A Hypersequent Calculus with Clusters for Data Logic over Ordinals. Search on Bibsonomy TABLEAUX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Ali Enayat, Joel David Hamkins Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes. Search on Bibsonomy J. Symb. Log. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Sanjay Jain 0001, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan 0001 The isomorphism problem for tree-automatic ordinals with addition. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Alexis Bès, Christian Choffrut Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Feresiano Mwesigye, John Kenneth Truss Ehrenfeucht-Fraïssé games on ordinals. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Matthew Wright Degrees of relations on ordinals. Search on Bibsonomy Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21David Baelde, Anthony Lick, Sylvain Schmitz A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Stephen Flood Ordinals and graph decompositions. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Anthony Bonato, Przemyslaw Gordinowicz, Gena Hahn Cops and Robbers ordinals of cop-win trees. Search on Bibsonomy Discret. Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Georg Moser KBOs, ordinals, subrecursive hierarchies and all that. Search on Bibsonomy J. Log. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Peter H. Schmitt A Mechanizable First-Order Theory of Ordinals. Search on Bibsonomy TABLEAUX The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. Search on Bibsonomy FSCD The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Jacob Hilton The Topological Pigeonhole Principle for Ordinals. Search on Bibsonomy J. Symb. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals. Search on Bibsonomy Arch. Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
21Zhen Zhang 0002, Chonghui Guo A VIKOR-Based Approach to Group Decision Making With Uncertain Preference Ordinals and Incomplete Weight Information. Search on Bibsonomy Informatica The full citation details ... 2016 DBLP  BibTeX  RDF
21Myung-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 ACIIDS (1) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Arno Pauly Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
21Aaron Hunter 0001 Infinite Ordinals and Finite Improvement. Search on Bibsonomy LORI The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Sourav Tarafder Ordinals in an Algebra-Valued Model of a Paraconsistent Set Theory. Search on Bibsonomy ICLA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Arno Pauly Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). Search on Bibsonomy MFCS (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Toshiyasu Arai Lifting Proof Theory to the Countable Ordinals: Zermelo-Fraenkel Set Theory. Search on Bibsonomy J. Symb. Log. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Claude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia Pairs of orthogonal countable ordinals. Search on Bibsonomy Discret. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Olivier Finkel, Stevo Todorcevic Automatic Ordinals. Search on Bibsonomy Int. J. Unconv. Comput. The full citation details ... 2013 DBLP  BibTeX  RDF
21Andreas Weiermann, Gunnar Wilken Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Philipp Schlicht, Frank Stephan 0001 Automata on ordinals and automaticity of linear orders. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Martin Huschenbett, Jiamou Liu A Polychromatic Ramsey Theory for Ordinals. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Michael Norrish, Brian Huffman Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1. Search on Bibsonomy ITP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon Local Computability for Ordinals. Search on Bibsonomy CiE The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Tim Fischbach, Benjamin Seyfferth On λ-Definable Functions on Ordinals. Search on Bibsonomy CiE The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Bahareh Afshari, Graham E. Leigh On closure ordinals for the modal mu-calculus. Search on Bibsonomy CSL The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Franck van Breugel On behavioural pseudometrics and closure ordinals. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
21Olivier Finkel, Stevo Todorcevic Automatic Ordinals Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
21Michiel De Smet, Andreas Weiermann Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
21Sarah Winkler, Harald Zankl, Aart Middeldorp Ordinals and Knuth-Bendix Orders. Search on Bibsonomy LPAR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
21Andreas Weiermann, Alan R. Woods Some Natural Zero One Laws for Ordinals Below ε 0. Search on Bibsonomy CiE The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 239 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license