Imagen de Portada

Fixed Point Theorems in Computability Theory

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Terwijn, Sebastiaan A.
Formato:	Preprint
Publicado:	2024
Materias:	Logic Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Completions of Kleene's second model
por: Terwijn, Sebastiaan A.
Publicado: (2023)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

Nonembeddings of Combinatory Algebras
por: Lutz, Patrick, et al.
Publicado: (2026)

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
por: Lyon, Tim S.
Publicado: (2024)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
por: Lichter, Moritz
Publicado: (2022)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
por: Hermes, Marc, et al.
Publicado: (2023)

Gödel Incompleteness Theorem for PAC Learnable Theory from the view of complexity measurement
por: Ma, Zhifeng, et al.
Publicado: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
por: Livson, Ori, et al.
Publicado: (2025)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

(Pointed) Univalence in Universe Category Models of Type Theory
por: Kapulkin, Chris, et al.
Publicado: (2025)

Strong Nominal Semantics for Fixed-Point Constraints
por: Caires-Santos, Ali K., et al.
Publicado: (2024)

Inapproximability of Unique Games in Fixed-Point Logic with Counting
por: Tucker-Foltz, Jamie
Publicado: (2021)

Primitive Recursive Dependent Type Theory
por: Buchholtz, Ulrik, et al.
Publicado: (2024)

Proceedings Twelfth Workshop on Fixed Points in Computer Science
por: Saurin, Alexis
Publicado: (2025)

Rings and Boolean Algebras as Algebraic Theories
por: De Faveri, Arturo
Publicado: (2025)

Bridging Computational Notions of Depth
por: Bienvenu, Laurent, et al.
Publicado: (2024)

The Pebble-Relation Comonad in Finite Model Theory
por: Montacute, Yoàv, et al.
Publicado: (2021)

Characterizing Sets of Theories That Can Be Disjointly Combined
por: Przybocki, Benjamin, et al.
Publicado: (2025)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Proof Theory and Decision Procedures for Deontic STIT Logics
por: Lyon, Tim S., et al.
Publicado: (2024)

Non-Derivability Results in Polymorphic Dependent Type Theory
por: Geuvers, Herman
Publicado: (2026)

Universal Proof Theory, TACL 2022 Lecture Notes
por: Iemhoff, Rosalie, et al.
Publicado: (2023)

A Naive Encoding of Russell's Paradox in Type Theory
por: Qu, Zhuoyuan
Publicado: (2025)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
por: Gratzer, Daniel, et al.
Publicado: (2024)

Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2018)

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2018)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
por: Kabir, Mohimenul, et al.
Publicado: (2025)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

A topological reading of inductive and coinductive definitions in Dependent Type Theory
por: Sabelli, Pietro
Publicado: (2024)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
por: De Domenico, Andrea, et al.
Publicado: (2024)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
por: Takahashi, Yuta
Publicado: (2024)

Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
por: Kura, Satoshi, et al.
Publicado: (2025)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

On Effective Banach-Mazur Games and an application to the Poincaré Recurrence Theorem for Category
por: Koul, Prajval, et al.
Publicado: (2025)

An Automated Theorem Generator with Theoretical Foundation Based on Rectangular Standard Contradiction
por: Xu, Yang, et al.
Publicado: (2025)

An Axiomatic Theory for Reversible Computation
por: Lanese, Ivan, et al.
Publicado: (2023)

Diagonalizing Through the $ω$-Chain: Iterated Self-Certification on Bounded Turing Machines and its Least Fixed Point
por: Sung, Miara
Publicado: (2026)

Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
por: Mannucci, Mirco A., et al.
Publicado: (2025)

Resource-Bounded Martin-Löf Type Theory: Compositional Cost Analysis for Dependent Types
por: Mannucci, Mirco A., et al.
Publicado: (2026)