Pages that link to "Item:Q1097252"

The following pages link to Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252):

Displaying 18 items.

• The problem of demodulating across argument and literal boundaries (Q688583) (← links)
• Term rewriting: Some experimental results (Q757071) (← links)
• The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
• Experimenting with Isabelle in ZF set theory (Q1312157) (← links)
• Set theory for verification. I: From foundations to functions (Q1319386) (← links)
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
• Issues in commonsense set theory (Q1346620) (← links)
• Computer proofs about finite and regular sets: The unifying concept of subvariance. (Q1404990) (← links)
• The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
• A finitely axiomatized formalization of predicate calculus with equality (Q1906674) (← links)
• TPS: A theorem-proving system for classical type theory (Q1923825) (← links)
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
• On sets, types, fixed points, and checkerboards (Q4645222) (← links)
• Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs (Q4916225) (← links)
• Layered map reasoning (Q4923516) (← links)
• The TPTP problem library (Q5210777) (← links)
• ILF-SETHEO (Q5234690) (← links)