Imagen de Portada

New Bounds for the Ideal Proof System in Positive Characteristic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Behera, Amik Raj, Limaye, Nutan, Ramanathan, Varun, Srinivasan, Srikanth
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Logic in Computer Science Logic F.4.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
por: Behera, Amik Raj, et al.
Publicado: (2026)

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

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

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

A Mimamsa Inspired Framework For Instruction Sequencing In AI Agents
por: Srinivasan, Bama
Publicado: (2025)

Structure-Guided Automated Reasoning
por: Bannach, Max, et al.
Publicado: (2023)

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

Set Theory in the Foundation of Math; Internal Classes and External Sets
por: Levin, Leonid A.
Publicado: (2022)

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

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

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

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

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

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

A Proof of the Schröder-Bernstein Theorem in ACL2
por: Jurgensen, Grant
Publicado: (2025)

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

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

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

Logic of Sets with Atoms
por: Masters, Jake
Publicado: (2025)

Semi-Substructural Logics à la Lambek
por: Wan, Cheng-Syuan
Publicado: (2024)

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

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
por: Binder, Sage, et al.
Publicado: (2026)

A Resolution-Based Interactive Proof System for UNSAT
por: Czerner, Philipp, et al.
Publicado: (2024)

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

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

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

The Limit of Recursion in State-based Systems
por: Afshari, Bahareh, et al.
Publicado: (2025)

On the Formal Metatheory of the Pure Type Systems using One-sorted Variable Names and Multiple Substitutions
por: Urciuoli, Sebastián
Publicado: (2025)

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

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

Semantics out of context: nominal absolute denotations for first-order logic and computation
por: Gabbay, Murdoch J.
Publicado: (2013)

Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
por: Santo, José Espírito, et al.
Publicado: (2020)

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

Constant time testability of first-order logic with modulo counting on finitary graphs
por: Adler, Isolde, et al.
Publicado: (2026)

A New Ehrenfeucht-Fraïssé Game for Dependence Logic
por: Puljujärvi, Joni, et al.
Publicado: (2026)

Trocq: Proof Transfer for Free, With or Without Univalence
por: Cohen, Cyril, et al.
Publicado: (2023)

Locality in Residuated-Lattice Structures
por: Carr, James
Publicado: (2025)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
por: Coniglio, M. E., et al.
Publicado: (2026)