The following pages link to Chad Edward Brown (Q438560):
Displayed 37 items.
- (Q286795) (redirect page) (← links)
- Reconsidering pairs and functions as sets (Q286796) (← links)
- Analytic tableaux for higher-order logic with choice (Q438561) (← links)
- TPS: A hybrid automatic-interactive system for developing proofs (Q865629) (← links)
- Lash 1.0 (system description) (Q2104521) (← links)
- A tale of two set theories (Q2287897) (← links)
- AIM loops and the AIM conjecture (Q2305344) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Reducing higher-order theorem proving to a sequence of SAT problems (Q2351156) (← links)
- (Q2723416) (← links)
- Extracting Higher-Order Goals from the Mizar Mathematical Library (Q2817297) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- (Q2871865) (← links)
- Satallax: An Automatic Higher-Order Prover (Q2908482) (← links)
- GLIVENKO AND KURODA FOR SIMPLE TYPE THEORY (Q2921007) (← links)
- (Q3086775) (← links)
- (Q3086777) (← links)
- Extended First-Order Logic (Q3183527) (← links)
- Analytic Tableaux for Simple Type Theory and its First-Order Fragment (Q3575302) (← links)
- (Q3586992) (← links)
- Combining Type Theory and Untyped Set Theory (Q3613410) (← links)
- Cut-Simulation in Impredicative Logics (Q3613411) (← links)
- Cut-Simulation and Impredicativity (Q3623018) (← links)
- Terminating Tableaux for the Basic Fragment of Simple Type Theory (Q3648727) (← links)
- (Q4809075) (← links)
- Explosive nonnegative solutions to two point boundary value problems (Q4861582) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (Q5200021) (← links)
- Higher-order semantics and extensionality (Q5311767) (← links)
- Automated Deduction – CADE-20 (Q5394604) (← links)
- Formal Representation of Mathematics in a Dependently Typed Set Theory (Q5428276) (← links)
- Theorem Proving in Higher Order Logics (Q5477647) (← links)
- Analytic Tableaux for Higher-Order Logic with Choice (Q5747752) (← links)
- Verifying and Invalidating Textbook Proofs Using Scunak (Q5756759) (← links)
- Higher-Order Tarski Grothendieck as a Foundation for Formal Proof. (Q5875415) (← links)
- Cantor-Bernstein implies Excluded Middle (Q6317469) (← links)