Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Parity Games and Propositional Proofs

From MaRDI portal
Publication:2849902
Jump to:navigation, search

DOI10.1007/978-3-642-40313-2_12zbMATH Open1343.03043OpenAlexW2123202585MaRDI QIDQ2849902FDOQ2849902

Arnold Beckmann, Pavel Pudlák, Neil Thapen

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_12




Recommendations

  • Parity Games and Propositional Proofs
  • From parity games to circular proofs
  • Parity games and automata for game logic
  • Reachability games and parity games
  • Proofs as Games
  • Some remarks on relations between proofs and games
  • Game theoretical semantics for paraconsistent logics
  • Partiality and games: Propositional logic
  • Justifications and a reconstruction of parity game solving algorithms
  • Proof systems and transformation games


Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Combinatorial games (91A46)



Cited In (2)

  • From parity games to circular proofs
  • Parity Games and Propositional Proofs





This page was built for publication: Parity Games and Propositional Proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849902)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2849902&oldid=15780373"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki