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

scientific article; zbMATH DE number 4200143

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

zbMATH Open0726.94015MaRDI QIDQ3348859FDOQ3348859

Pavel Pudlák

Publication date: 1990



Title of this publication is not available (Why is that?)



Recommendations

  • SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
  • scientific article; zbMATH DE number 3877162
  • Publication:3204500
  • Improved boolean formulas for the Ramsey graphs
  • Boolean lattices: Ramsey properties and embeddings


zbMATH Keywords

Ramsey theorycircuit complexityBoolean complexity


Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)



Cited In (5)

  • On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic
  • SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
  • A packed Ramsey’s theorem and computability theory
  • Title not available (Why is that?)
  • The canonical Ramsey theorem and computability theory





This page was built for publication:

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

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