The following pages link to (Q3575996):
Displaying 11 items.
- In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid (Q408542) (← links)
- Asymptotic densities in logic and type theory (Q931404) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- Asymptotic Properties of Combinatory Logic (Q2948454) (← links)
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison (Q3499752) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations (Q5041257) (← links)
- (Q5092413) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
