Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Proof Complexity of Non-classical Logics

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

DOI10.1007/978-3-642-13562-0_3zbMath1284.03257OpenAlexW2406716656WikidataQ59903358 ScholiaQ59903358MaRDI QIDQ5900979

Olaf Beyersdorff

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/74776/10/beyersdorff.pdf



Mathematics Subject Classification ID

Complexity of proofs (03F20)


Related Items (1)

Proof Complexity of Non-classical Logics







This page was built for publication: Proof Complexity of Non-classical Logics

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5900979&oldid=16966629"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 02:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki