Cover Image

Some Observations on Infinitary Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Carl, Merlin
Format:	Preprint
Published:	2018
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)

Reduction Complexities in Set Theory
by: Carl, Merlin
Published: (2025)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)

Modules and Infinitary Logics
by: Shelah, Saharon
Published: (2010)

On Some Infinitary Logics
by: Vaananen, Jouko, et al.
Published: (2024)

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

The Lost Melody Phenomenon
by: Carl, Merlin
Published: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
by: Carl, Merlin
Published: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
by: Carl, Merlin
Published: (2020)

Structures Associated with Real Closed Fields and the Axiom of Choice
by: Carl, Merlin
Published: (2014)

Space-Bounded OTMs and REG$^{\infty}$
by: Carl, Merlin
Published: (2017)

A Note on OTM-Realizability and Constructive Set Theories
by: Carl, Merlin
Published: (2019)

Recognizable Realizability
by: Carl, Merlin
Published: (2024)

Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)

Taming Koepke's Zoo II: Register Machines
by: Carl, Merlin
Published: (2019)

Optimal Results on ITRM-recognizability
by: Carl, Merlin
Published: (2013)

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

The distribution of ITRM-recognizable reals
by: Carl, Merlin
Published: (2012)

Models of true arithmetic are integer parts of nice real closed fields
by: Carl, Merlin
Published: (2013)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
by: Carl, Merlin
Published: (2021)

A Note on Power-OTMs
by: Carl, Merlin
Published: (2024)

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
by: Carl, Merlin
Published: (2022)

Generalized Effective Reducibility
by: Carl, Merlin
Published: (2016)

Almost sure OTM-realizability
by: Carl, Merlin
Published: (2024)

Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
by: Carl, Merlin
Published: (2023)

Canonical Truth
by: Carl, Merlin, et al.
Published: (2017)

Randomness via infinite computation and effective descriptive set theory
by: Carl, Merlin, et al.
Published: (2016)

Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
by: Acclavio, Matteo, et al.
Published: (2023)

Improving the Diproche CNL through Autoformalization via Large Language Models
by: Carl, Merlin
Published: (2023)

Expressive Power of Infinitary Logic and Absolute co-Hopfianity
by: Asgharzadeh, Mohsen, et al.
Published: (2023)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
by: Carl, Merlin, et al.
Published: (2015)

CoLF Logic Programming as Infinitary Proof Exploration
by: Chen, Zhibo, et al.
Published: (2025)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
by: Cerda, Rémy, et al.
Published: (2022)

Infinitary Logics and Abstract Elementary Classes
by: Shelah, Saharon, et al.
Published: (2020)

Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs
by: Cerda, Rémy, et al.
Published: (2025)

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

Infinitary Logic Has No Expressive Efficiency Over Finitary Logic
by: Harrison-Trainor, Matthew, et al.
Published: (2022)