The following pages link to And/Or Trees Revisited (Q4670353):
Displaying 18 items.
- In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid (Q408542) (← links)
- 2-Xor revisited: satisfiability and probabilities of functions (Q727973) (← links)
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- Enumerating lambda terms by weighted length of their de Bruijn representation (Q1706116) (← links)
- TBA and tree expansion (Q1719678) (← links)
- Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
- Recurrent and transient trees (Q2654556) (← links)
- Fragmentation Trees Reloaded (Q2814578) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- Asymptotic Properties of Combinatory Logic (Q2948454) (← links)
- Retractions to Pseudoforests (Q3084215) (← links)
- The distribution of height and diameter in random non-plane binary trees (Q3165458) (← links)
- A sprouting tree model for random boolean functions (Q3460511) (← links)
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison (Q3499752) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System (Q3605535) (← links)
- Renorming James tree space (Q4679393) (← links)
- (Q4953180) (← links)