The following pages link to \(T\)-theorem proving. I (Q1914165):
Displaying 12 items.
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- FTP'2003: 4th international workshop on first-order theorem proving. Proceedings of the workshop (in connection with RDP'03, federated conference on rewriting, deduction and programming), Valencia, Spain, June 12--14, 2003 (Q877561) (← links)
- \(T\)-resolution: Refinements and model elimination (Q1284706) (← links)
- Automated deduction by theory resolution (Q1821564) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- A set-theoretic translation method for polymodal logics (Q1904398) (← links)
- Structured proof procedures (Q1924823) (← links)
- Theorem proving with structured theories. (Preliminary report) (Q2741534) (← links)
- TLA + Proofs (Q4647839) (← links)
- Combining Non-Stably Infinite Theories (Q4916220) (← links)
- Automated Reasoning (Q5307060) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
