Cover Image

Universal Gluing and Contextual Choice: Categorical Logic and the Foundations of Analytic Approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Santacana, Andreu Ballus
Format:	Preprint
Published:	2025
Subjects:	Functional Analysis Logic in Computer Science Logic 03F65, 03B30, 46E35, 68Q55 F.4.1; G.1.2; F.3.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

Symmetries in Sorting
by: Choudhury, Vikraman, et al.
Published: (2025)

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

Matching logic -- a new axiomatization
by: Leuştean, Laurenţiu, et al.
Published: (2025)

Notes on applicative matching logic
by: Leuştean, Laurenţiu
Published: (2025)

An Incremental Framework for Topological Dialogue Semantics: Efficient Reasoning in Discrete Spaces
by: Santacana, Andreu Ballus
Published: (2025)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

An Expressive Trace Logic for Recursive Programs
by: Gurov, Dilian, et al.
Published: (2024)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
by: Borzechowski, Manfred, et al.
Published: (2025)

Approximate Axiomatization for Differentially-Defined Functions
by: Platzer, André, et al.
Published: (2025)

Continuous and algebraic domains in univalent foundations
by: de Jong, Tom, et al.
Published: (2024)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

A vector logic for extensional formal semantics
by: Quigley, Daniel
Published: (2024)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
by: Walsh, Sean
Published: (2024)

Glivenko's theorems from an ecumenical perspective
by: Pereira, Luiz Carlos, et al.
Published: (2026)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)

Proof Compression via Subatomic Logic and Guarded Substitutions
by: Barrett, Victoria, et al.
Published: (2025)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Structural focalization
by: Simmons, Robert J.
Published: (2011)

Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)

Internal Effectful Forcing in System T
by: Escardo, Martin H., et al.
Published: (2025)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Relational Connectors and Heterogeneous Bisimulations
by: Nora, Pedro, et al.
Published: (2024)

2-Coherent Internal Models of Homotopical Type Theory
by: Chen, Joshua
Published: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

Logic in Mathematics and Computer Science
by: Zach, Richard
Published: (2024)

Thoughts on sub-Turing interactive computability
by: Japaridze, Giorgi
Published: (2024)