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

Complexity of strict implication

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

zbMATH Open1102.03014MaRDI QIDQ5482999FDOQ5482999


Authors: Félix Bou Edit this on Wikidata


Publication date: 15 August 2006





Recommendations

  • Computer Science Logic
  • scientific article; zbMATH DE number 1778908
  • scientific article; zbMATH DE number 3995647
  • Pure strict implication logics
  • Sequent Calculi for Some Strict Implication Logics


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)



Cited In (3)

  • A System for Strict Implication
  • A note on the computational complexity of the pure classical implication calculus
  • Pure strict implication logics





This page was built for publication: Complexity of strict implication

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

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