Almost all Classical Theorems are Intuitionistic

DOI10.1051/ita/2022009OpenAlexW4226445544MaRDI QIDQ5871575

Pierre Lescanne

Publication date: 23 January 2023

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.06723

zbMATH Keywords

combinatoricsCatalan numberBell numberasymptoticintuitionistic logicrandom generationclassical logicMonte-Carlo method

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Boolean functions (06E30) Intuitionistic mathematics (03F55) Software, source code, etc. for problems pertaining to combinatorics (05-04) Computational methods for problems pertaining to combinatorics (05-08)

Uses Software

• SageMath
• OEIS

Cites Work

• Generation of a random partition of a finite set by an urn model
• Untersuchungen über das logische Schliessen. I
• A hiking trip through the orders of magnitude: deriving efficient generators for closed simply-typed lambda terms and normal forms
• Intuitionistic vs. Classical Tautologies, Quantitative Comparison
• Classical and Intuitionistic Logic Are Asymptotically Identical
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost all Classical Theorems are Intuitionistic