:: Library Catalog

$Cover Image$

Saved in:

Bibliographic Details
Main Author:	Levin, Leonid A.
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science Computational Complexity Information Theory F.4.1
Online Access:	https://arxiv.org/abs/2209.07497
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

Complexity of Nonassociative Lambek Calculus with classical logic
by: Płaczek, Paweł
Published: (2024)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
by: Ito, Sohei, et al.
Published: (2026)

Logic of Sets with Atoms
by: Masters, Jake
Published: (2025)

Structure-Guided Automated Reasoning
by: Bannach, Max, et al.
Published: (2023)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2008)

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
by: Pratt-Hartmann, Ian
Published: (2007)

Computation as a Game
by: Bilokon, Paul Alexander
Published: (2025)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

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

Extracting Policies from Quantified Answer Set Programs
by: Diéguez, Martín, et al.
Published: (2026)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

Mechanized HOL Reasoning in Set Theory
by: Guilloud, Simon, et al.
Published: (2024)

A Guide to Krivine Realizability for Set Theory
by: Matthews, Richard
Published: (2023)

Logics for the Relational Syllogistic
by: Pratt-Hartmann, Ian, et al.
Published: (2008)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
by: van der Giessen, Iris, et al.
Published: (2023)

Left-Linear Rewriting in Adhesive Categories
by: Baldan, Paolo, et al.
Published: (2024)

Constructive and Predicative Locale Theory in Univalent Foundations
by: Tosun, Ayberk
Published: (2026)

Sensible Intersection Type Theories
by: Dezani-Ciancaglini, Mariangiola, et al.
Published: (2026)

Type Theory with Single Substitutions
by: Kaposi, Ambrus, et al.
Published: (2025)

The Latent Space of Equational Theories
by: Berlioz, Luis, et al.
Published: (2026)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

Homological Invariants of Higher-Order Equational Theories
by: Ikebuchi, Mirai
Published: (2025)

Di- is for Directed: First-Order Directed Type Theory via Dinaturality
by: Laretto, Andrea, et al.
Published: (2024)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

Implicit Knowledge in Unawareness Structures
by: Belardinelli, Gaia, et al.
Published: (2023)

Satisfiability in Łukasiewicz logic and its unbounded relative
by: Haniková, Zuzana, et al.
Published: (2025)

Semi-Substructural Logics à la Lambek
by: Wan, Cheng-Syuan
Published: (2024)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
by: Becker, Justus
Published: (2025)

A Topological Rewriting of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)

Cardinality and Representation of Stone Relation Algebras
by: Furusawa, Hitoshi, et al.
Published: (2023)

Local-Order-Invariant Logic on Classes of Bounded Degree
by: Aoki, Derek
Published: (2025)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)