Search results for "ordinals"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
97	Peter Koepke, Ryan Siders	Register computations on ordinals.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03D60, 03E45
76	Philip D. Welch	The Transfinite Action of 1 Tape Turing Machines.	CiE	2005	DBLP DOI BibTeX RDF
72	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	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.	LATIN	1998	DBLP DOI BibTeX RDF
63	M. Randall Holmes	The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory.	Stud Logica	2005	DBLP DOI BibTeX RDF	double extension set theory, universal set, ordinals
61	Sébastien Konieczny	Using Transfinite Ordinal Conditional Functions.	ECSQARU	2009	DBLP DOI BibTeX RDF
61	Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio	Higher-Order Termination: From Kruskal to Computability.	LPAR	2006	DBLP DOI BibTeX RDF
61	Peter Koepke	Computing a Model of Set Theory.	CiE	2005	DBLP DOI BibTeX RDF
61	Panagiotis Manolios, Daron Vroon 0001	Algorithms for Ordinal Arithmetic.	CADE	2003	DBLP DOI BibTeX RDF
57	Harvey Friedman	Some Decision Problems of Enormous Complexity.	LICS	1999	DBLP DOI BibTeX RDF	proof thoery, complexity, trees, hypergraphs, ordinals
51	Ariya Isihara	Hydra Games and Tree Ordinals.	WoLLIC	2007	DBLP DOI BibTeX RDF
51	Stéphane Demri, Alexander Rabinovich	The Complexity of Temporal Logic with Until and Since over Ordinals.	LPAR	2007	DBLP DOI BibTeX RDF
51	Christian Choffrut	Elementary Theory of Ordinals with Addition and Left Translation by omega.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
46	Harold Simmons	Fruitful and helpful ordinal functions.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03E10
46	Daniel W. Cunningham	A covering lemma for K(\mathbb R).	Arch. Math. Log.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03E45, 03E60
46	Arnold Beckmann	Dynamic ordinal analysis.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
46	Daniel W. Cunningham	A covering lemma for L(R).	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
42	Toshiyasu Arai	Proof theory for theories of ordinals - I: recursively Mahlo ordinals.	Ann. Pure Appl. Log.	2003	DBLP DOI BibTeX RDF
36	Alexander Rabinovich, Amit Shomrat	Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey.	Pillars of Computer Science	2008	DBLP DOI BibTeX RDF
36	Matt Kaufmann, Konrad Slind	Proof Pearl: Wellfounded Induction on the Ordinals Up to epsilon 0.	TPHOLs	2007	DBLP DOI BibTeX RDF
36	Michael Rathjen	Theories and Ordinals: Ordinal Analysis.	CiE	2007	DBLP DOI BibTeX RDF
36	Benjamin R. George	Second-Order Characterizable Cardinals and Ordinals.	Stud Logica	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.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF
36	Herman Ruge Jervell	Finite Trees as Ordinals.	CiE	2005	DBLP DOI BibTeX RDF
36	Jeffry L. Hirst	Reverse mathematics of prime factorization of ordinals.	Arch. Math. Log.	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.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF
36	Nachum Dershowitz	Trees, Ordinals and Termination.	TAPSOFT	1993	DBLP DOI BibTeX RDF
30	Joel David Hamkins, Russell G. Miller	Post's Problem for Ordinal Register Machines.	CiE	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.	ACM Trans. Comput. Log.	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.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	automated reasoning, arithmetic, ACL2, ordinal
30	Todd Eisworth, Saharon Shelah	Successors of singular cardinals and coloring theorems I.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Jonsson cardinals, coloring theorms, successors of singular cardinals
30	Harold Simmons	A comparison of two systems of ordinal notations.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF
30	Lev D. Beklemishev	Proof-theoretic analysis by iterated reflection.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
30	Michael Möllerfeld, Michael Rathjen	A note on the Sigma1 spectrum of a theory.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
30	Panos Rondogiannis, William W. Wadge	An Infinite-Valued Semantics for Logic Programs with Negation.	JELIA	2002	DBLP DOI BibTeX RDF
30	Krzysztof R. Apt, Gordon D. Plotkin	Countable nondeterminism and random assignment.	J. ACM	1986	DBLP DOI BibTeX RDF
27	Andreas Weiermann	A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets.	CiE	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.	Order	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.	Arch. Math. Log.	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.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Termination, Term rewriting systems, Ordinals
21	Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov	Generalized fusible numbers and their ordinals.	Ann. Pure Appl. Log.	2024	DBLP DOI BibTeX RDF
21	Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Type-theoretic approaches to ordinals.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
21	Lior Shiboli, Gabriel Nivasch	Ordinals and recursive algorithms.	CoRR	2023	DBLP DOI BibTeX RDF
21	Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Set-Theoretic and Type-Theoretic Ordinals Coincide.	CoRR	2023	DBLP DOI BibTeX RDF
21	Miha E. Habic, Radek Honzik	Capturing sets of ordinals by normal ultrapowers.	Ann. Pure Appl. Log.	2023	DBLP DOI BibTeX RDF
21	Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Set-Theoretic and Type-Theoretic Ordinals Coincide.	LICS	2023	DBLP DOI BibTeX RDF
21	Thomas Colcombet, Sam van Gool, Rémi Morvan	First-order separation over countable ordinals.	CoRR	2022	DBLP BibTeX RDF
21	Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov	Generalized fusible numbers and their ordinals.	CoRR	2022	DBLP DOI BibTeX RDF
21	Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Type-Theoretic Approaches to Ordinals.	CoRR	2022	DBLP DOI BibTeX RDF
21	Thomas Colcombet, Sam van Gool, Rémi Morvan	First-order separation over countable ordinals.	FoSSaCS	2022	DBLP DOI BibTeX RDF
21	Jeffrey Bergfalk	Dimensions of Ordinals: Set Theory, Homology Theory, and the First Omega Alephs.	Bull. Symb. Log.	2021	DBLP DOI BibTeX RDF
21	Dragan Masulovic, Branislav Sobot	Countable Ordinals and Big Ramsey Degrees.	Comb.	2021	DBLP DOI BibTeX RDF
21	Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Connecting Constructive Notions of Ordinals in Homotopy Type Theory.	CoRR	2021	DBLP BibTeX RDF
21	Juan P. Aguilera 0001	A characterization of Σ11-reflecting ordinals.	Ann. Pure Appl. Log.	2021	DBLP DOI BibTeX RDF
21	Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu	Connecting Constructive Notions of Ordinals in Homotopy Type Theory.	MFCS	2021	DBLP DOI BibTeX RDF
21	Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud	Degrees of categoricity above limit ordinals.	Comput.	2020	DBLP DOI BibTeX RDF
21	Peter H. Schmitt	Two First-Order Theories of Ordinals.	Fields of Logic and Computation III	2020	DBLP DOI BibTeX RDF
21	Nikolay Bazhenov 0001, Stefan V. Vatev	A Note on Computable Embeddings for Ordinals and Their Reverses.	CiE	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.	J. Intell. Fuzzy Syst.	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.	Inf. Process. Lett.	2019	DBLP DOI BibTeX RDF
21	Sebastian Koch	Natural Addition of Ordinals.	Formaliz. Math.	2019	DBLP DOI BibTeX RDF
21	Basil Lourié	What Means 'Tri-' in 'Trinity'? An Eastern Patristic Approach to the 'Quasi-Ordinals'.	FLAP	2019	DBLP BibTeX RDF
21	Maria Hämeen-Anttila	Nominalistic Ordinals, Recursion on Higher Types, and finitism.	Bull. Symb. Log.	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.	Arch. Math. Log.	2019	DBLP DOI BibTeX RDF
21	Gian Carlo Milanese, Yde Venema	Closure Ordinals of the Two-Way Modal µ-Calculus.	WoLLIC	2019	DBLP DOI BibTeX RDF
21	Anthony Lick	A Hypersequent Calculus with Clusters for Data Logic over Ordinals.	TABLEAUX	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.	J. Symb. Log.	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.	CoRR	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.	CoRR	2018	DBLP BibTeX RDF
21	Feresiano Mwesigye, John Kenneth Truss	Ehrenfeucht-Fraïssé games on ordinals.	Ann. Pure Appl. Log.	2018	DBLP DOI BibTeX RDF
21	Matthew Wright	Degrees of relations on ordinals.	Comput.	2018	DBLP DOI BibTeX RDF
21	David Baelde, Anthony Lick, Sylvain Schmitz	A Hypersequent Calculus with Clusters for Tense Logic over Ordinals.	FSTTCS	2018	DBLP DOI BibTeX RDF
21	Stephen Flood	Ordinals and graph decompositions.	Ann. Pure Appl. Log.	2017	DBLP DOI BibTeX RDF
21	Anthony Bonato, Przemyslaw Gordinowicz, Gena Hahn	Cops and Robbers ordinals of cop-win trees.	Discret. Math.	2017	DBLP DOI BibTeX RDF
21	Georg Moser	KBOs, ordinals, subrecursive hierarchies and all that.	J. Log. Comput.	2017	DBLP DOI BibTeX RDF
21	Peter H. Schmitt	A Mechanizable First-Order Theory of Ordinals.	TABLEAUX	2017	DBLP DOI BibTeX RDF
21	Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel	Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL.	FSCD	2017	DBLP DOI BibTeX RDF
21	Jacob Hilton	The Topological Pigeonhole Principle for Ordinals.	J. Symb. Log.	2016	DBLP DOI BibTeX RDF
21	Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel	Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals.	Arch. Formal Proofs	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.	Informatica	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.	ACIIDS (1)	2016	DBLP DOI BibTeX RDF
21	Arno Pauly	Computability on the countable ordinals and the Hausdorff-Kuratowski theorem.	CoRR	2015	DBLP BibTeX RDF
21	Aaron Hunter 0001	Infinite Ordinals and Finite Improvement.	LORI	2015	DBLP DOI BibTeX RDF
21	Sourav Tarafder	Ordinals in an Algebra-Valued Model of a Paraconsistent Set Theory.	ICLA	2015	DBLP DOI BibTeX RDF
21	Arno Pauly	Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract).	MFCS (1)	2015	DBLP DOI BibTeX RDF
21	Toshiyasu Arai	Lifting Proof Theory to the Countable Ordinals: Zermelo-Fraenkel Set Theory.	J. Symb. Log.	2014	DBLP DOI BibTeX RDF
21	Claude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia	Pairs of orthogonal countable ordinals.	Discret. Math.	2014	DBLP DOI BibTeX RDF
21	Olivier Finkel, Stevo Todorcevic	Automatic Ordinals.	Int. J. Unconv. Comput.	2013	DBLP BibTeX RDF
21	Andreas Weiermann, Gunnar Wilken	Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0.	Ann. Pure Appl. Log.	2013	DBLP DOI BibTeX RDF
21	Philipp Schlicht, Frank Stephan 0001	Automata on ordinals and automaticity of linear orders.	Ann. Pure Appl. Log.	2013	DBLP DOI BibTeX RDF
21	Martin Huschenbett, Jiamou Liu	A Polychromatic Ramsey Theory for Ordinals.	MFCS	2013	DBLP DOI BibTeX RDF
21	Michael Norrish, Brian Huffman	Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1.	ITP	2013	DBLP DOI BibTeX RDF
21	Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon	Local Computability for Ordinals.	CiE	2013	DBLP DOI BibTeX RDF
21	Tim Fischbach, Benjamin Seyfferth	On λ-Definable Functions on Ordinals.	CiE	2013	DBLP DOI BibTeX RDF
21	Bahareh Afshari, Graham E. Leigh	On closure ordinals for the modal mu-calculus.	CSL	2013	DBLP DOI BibTeX RDF
21	Franck van Breugel	On behavioural pseudometrics and closure ordinals.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
21	Olivier Finkel, Stevo Todorcevic	Automatic Ordinals	CoRR	2012	DBLP BibTeX RDF
21	Michiel De Smet, Andreas Weiermann	Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal.	Ann. Pure Appl. Log.	2012	DBLP DOI BibTeX RDF
21	Sarah Winkler, Harald Zankl, Aart Middeldorp	Ordinals and Knuth-Bendix Orders.	LPAR	2012	DBLP DOI BibTeX RDF
21	Andreas Weiermann, Alan R. Woods	Some Natural Zero One Laws for Ordinals Below ε 0.	CiE	2012	DBLP DOI BibTeX RDF