:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Brattka, Vasco
Formato:	Preprint
Publicado:	2020
Materias:	Logic Logic in Computer Science
Acceso en línea:	https://arxiv.org/abs/2012.02143
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Effective bases and notions of effective second countability in computable analysis
por: Brattka, Vasco, et al.
Publicado: (2025)

Loops, Inverse Limits and Non-Determinism
por: Brattka, Vasco
Publicado: (2025)

Uniform Computability of PAC Learning
por: Brattka, Vasco, et al.
Publicado: (2026)

Computability of the Hahn-Banach Theorem Revisited
por: Brattka, Vasco, et al.
Publicado: (2026)

Computability of Initial Value Problems
por: Brattka, Vasco, et al.
Publicado: (2024)

Computable Bases
por: Brattka, Vasco, et al.
Publicado: (2025)

Problems and Consequences of Bilateral Notions of (Meta-)Derivability
por: Ayhan, Sara
Publicado: (2025)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

Network Satisfaction Problems Solved by k-Consistency
por: Bodirsky, Manuel, et al.
Publicado: (2023)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
por: Bournez, Olivier, et al.
Publicado: (2024)

Sequent Calculi for Data-Aware Modal Logics
por: Areces, Carlos, et al.
Publicado: (2025)

Degrees of incomputability, realizability and constructive reverse mathematics
por: Kihara, Takayuki
Publicado: (2020)

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

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
por: Oda, Yukihiro
Publicado: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
por: Gaßner, Christine
Publicado: (2025)

Demystifying $μ$
por: Afshari, Bahareh, et al.
Publicado: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
por: Artale, Alessandro, et al.
Publicado: (2025)

Proof-theoretic Semantics for Second-order Logic
por: Gheorghiu, Alexander V., et al.
Publicado: (2025)

List types for resource aware languages: an implicit name approach
por: Ghilezan, Silvia, et al.
Publicado: (2021)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
por: Afshari, Bahareh, et al.
Publicado: (2024)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
por: Hansen, Helle Hvid, et al.
Publicado: (2025)

Generalized Decidability via Brouwer Trees
por: de Jong, Tom, et al.
Publicado: (2026)

Constructive higher sheaf models with applications to synthetic mathematics
por: Coquand, Thierry, et al.
Publicado: (2026)

Bijective proofs for Eulerian numbers of types B and D
por: Santocanale, Luigi
Publicado: (2021)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
por: Herbelin, Hugo
Publicado: (2024)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
por: Powell, Thomas
Publicado: (2023)

The strength of the dominance rule
por: Kołodziejczyk, Leszek Aleksander, et al.
Publicado: (2024)

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

A Coalgebraic Semantics for Intuitionistic Modal Logic
por: Almeida, Rodrigo Nicolau, et al.
Publicado: (2024)

A concrete model for a typed linear algebraic lambda calculus
por: Díaz-Caro, Alejandro, et al.
Publicado: (2018)

Decidability of Quasi-Dense Modal Logics
por: Ostropolski-Nalewaja, Piotr, et al.
Publicado: (2024)

Countability constraints in order-theoretic approaches to computability
por: Hack, Pedro, et al.
Publicado: (2022)

The subTuring degrees
por: Kihara, Takayuki, et al.
Publicado: (2024)

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

Proof-Theoretic Functional Completeness for the Connexive Logic C
por: Ayhan, Sara, et al.
Publicado: (2025)

On semantics of first-order justification logic with binding modalities
por: Yavorskaya, Tatiana, et al.
Publicado: (2025)

Basis-Sensitive Quantum Typing via Realisability
por: Díaz-Caro, Alejandro, et al.
Publicado: (2025)

An abstract fixed-point theorem for Horn formula equations
por: Hetzl, Stefan, et al.
Publicado: (2025)

Uniform interpolation with constructive diamond
por: van der Giessen, Iris, et al.
Publicado: (2026)