Image de couverture de livre

A concise proof of Commoner's theorem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Jancar, Petr
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
par: Jančar, Petr, et autres
Publié: (2022)

Structural Liveness of Immediate Observation Petri Nets
par: Jancar, Petr, et autres
Publié: (2021)

Structural Liveness of Conservative Petri Nets
par: Jančar, Petr, et autres
Publié: (2025)

Towards solid abelian groups: A formal proof of Nöbeling's theorem
par: Asgeirsson, Dagur
Publié: (2023)

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
par: Das, Anupam, et autres
Publié: (2024)

A proof-theoretic approach to abstract interpretation
par: D'Silva, Vijay, et autres
Publié: (2026)

A logic of judgmental existence and its relation to proof irrelevance
par: Pezlar, Ivo
Publié: (2024)

A linear proof language for second-order intuitionistic linear logic
par: Díaz-Caro, Alejandro, et autres
Publié: (2023)

Bijective proofs for Eulerian numbers of types B and D
par: Santocanale, Luigi
Publié: (2021)

The proof theory and semantics of second-order (intuitionistic) tense logic
par: Becker, Justus, et autres
Publié: (2026)

Wider systems for linear logic with fixed points: proof theory and complexity
par: Das, Anupam, et autres
Publié: (2026)

A Cobham theorem for scalar multiplication
par: Hieronymi, Philipp, et autres
Publié: (2024)

A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
par: d'Aragona, Antonio Piccolomini
Publié: (2025)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
par: Oda, Yukihiro, et autres
Publié: (2021)

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

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
par: Oda, Yukihiro, et autres
Publié: (2022)

Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
par: Kozhemiachenko, Daniil
Publié: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
par: Das, Anupam, et autres
Publié: (2024)

Incompleteness theorems via Turing category
par: Savelyev, Yasha
Publié: (2024)

Short proofs without interference
par: Rebola-Pardo, Adrian
Publié: (2025)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
par: Przybocki, Benjamin, et autres
Publié: (2024)

An abstract fixed-point theorem for Horn formula equations
par: Hetzl, Stefan, et autres
Publié: (2025)

An ecumenical view of proof-theoretic semantics
par: Nascimento, Victor, et autres
Publié: (2023)

A precise proof of the n-variable Bekic principle
par: Xu, Jun
Publié: (2025)

Ajtai's theorem for $T^2_2(R)$ and pebble games with backtracking
par: Ken, Eitetsu, et autres
Publié: (2024)

Between proof construction and SAT-solving
par: Schubert, Aleksy, et autres
Publié: (2024)

On the role of connectivity in Linear Logic proofs
par: Di Donna, Raffaele, et autres
Publié: (2025)

Topological Semantics for Common Inductive Knowledge
par: Namachivayam, Siddharth
Publié: (2026)

A syntactic proof of decidability for the logic of bunched implication BI
par: Ramanayake, Revantha
Publié: (2016)

Dyadic obligations: proofs and countermodels via hypersequents
par: Ciabattoni, Agata, et autres
Publié: (2024)

Computational expressivity of (circular) proofs with fixed points
par: Curzi, Gianluca, et autres
Publié: (2023)

Cyclic proof theory of positive inductive definitions
par: Curzi, Gianluca, et autres
Publié: (2025)

Non-wellfounded parsimonious proofs and non-uniform complexity
par: Acclavio, Matteo, et autres
Publié: (2024)

A method for the automated generation of proof exercises with comparable levels of proving complexity
par: Mendes, João, et autres
Publié: (2026)

Logic of (Common or Distributed) Knowledge
par: Shi, Chenwei
Publié: (2025)

Common Knowledge, Sailboats, and Publicity
par: Bozdag, Sena, et autres
Publié: (2025)

Birkhoff style proof systems for hybrid-dynamic quantum logic
par: Gaina, Daniel
Publié: (2024)

Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
par: Di Guardia, Rémi, et autres
Publié: (2026)

Sharing proofs with predicative theories through universe-polymorphic elaboration
par: Felicissimo, Thiago, et autres
Publié: (2023)

Lean-SMT: An SMT tactic for discharging proof goals in Lean
par: Mohamed, Abdalrhman, et autres
Publié: (2025)