On the public citation graph

Set theory in first-order logic: Clauses for Gödel's axioms

0 signed · 68 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0004-3702(71)90004-xopenalex-snapshot

Splitting and reduction heuristics in automatic theorem proving

inferredcites →https://doi.org/10.1090/conm/029openalex-snapshot

Automated Theorem Proving: After 25 Years

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10721959_9openalex-snapshot

Gödel’s Algorithm for Class Formation

inferred← citeshttps://doi.org/10.1007/11814771_19openalex-snapshot

Combining Type Theory and Untyped Set Theory

inferred← citeshttps://doi.org/10.1007/3-540-19129-1_10openalex-snapshot

Hints for the design of a set calculus oriented to Automated Deduction

inferred← citeshttps://doi.org/10.1007/3-540-39185-1_18openalex-snapshot

A Finite First-Order Presentation of Set Theory

inferred← citeshttps://doi.org/10.1007/3-540-45744-5_12openalex-snapshot

Instructing Equational Set-Reasoning with Otter

inferred← citeshttps://doi.org/10.1007/3-540-46508-1_12openalex-snapshot

An Equational Re-engineering of Set Theories

inferred← citeshttps://doi.org/10.1007/3-540-48660-7_32openalex-snapshot

A Breadth-First Strategy for Mating Search

inferred← citeshttps://doi.org/10.1007/3-540-52531-9_154openalex-snapshot

Design and development of ENprover, an automated theorem proving system based on EN-strategy

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_18openalex-snapshot

The TPTP problem library

inferred← citeshttps://doi.org/10.1007/3-540-61208-4_1openalex-snapshot

On sets, types, fixed points, and checkerboards

inferred← citeshttps://doi.org/10.1007/3-540-63104-6_8openalex-snapshot

ILF-SETHEO

inferred← citeshttps://doi.org/10.1007/978-0-387-34979-4_56openalex-snapshot

EnCal: An Automated Forward Deduction System for General-Purpose Entailment Calculus

inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_3openalex-snapshot

Stepping Stones in the TPTP World

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_2openalex-snapshot

Membership and Edge Relations

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_3openalex-snapshot

Sets, Graphs, and Set Universes

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_4openalex-snapshot

The Undirected Structure Underlying Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_5openalex-snapshot

Graphs as Transitive Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_6openalex-snapshot

Counting and Encoding Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_7openalex-snapshot

Random Generation of Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-54981-1_8openalex-snapshot

Infinite Sets and Finite Combinatorics

inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_9openalex-snapshot

From MKRP to ΩMEGA

inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_18openalex-snapshot

Reasoning about Iteration in Gödel’s Class Theory

inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_13openalex-snapshot

A Finite First-Order Theory of Classes

inferred← citeshttps://doi.org/10.1007/bf00243005openalex-snapshot

Automated reasoning about elementary point-set topology

inferred← citeshttps://doi.org/10.1007/bf00243795openalex-snapshot

The problem of extending the set of support strategy

inferred← citeshttps://doi.org/10.1007/bf00244488openalex-snapshot

Computer proofs in Group Theory

inferred← citeshttps://doi.org/10.1007/bf00245023openalex-snapshot

The problem of finding an inference rule for set theory

inferred← citeshttps://doi.org/10.1007/bf00245299openalex-snapshot

The problem of demodulating across argument and literal boundaries

inferred← citeshttps://doi.org/10.1007/bf00247438openalex-snapshot

The problem of definition expansion and contraction

inferred← citeshttps://doi.org/10.1007/bf00247826openalex-snapshot

Recognizing unnecessary clauses in resolution based systems

inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot

TPS: A theorem-proving system for classical type theory

inferred← citeshttps://doi.org/10.1007/bf00263451openalex-snapshot

Automated deduction in von Neumann-Bernays-G�del set theory

inferred← citeshttps://doi.org/10.1007/bf00712384openalex-snapshot

Nonstandard set theories and information management

inferred← citeshttps://doi.org/10.1007/bf00849061openalex-snapshot

Issues in commonsense set theory

inferred← citeshttps://doi.org/10.1007/bf00881795openalex-snapshot

The kernel strategy and its use for the study of combinatory logic

inferred← citeshttps://doi.org/10.1007/bf00881863openalex-snapshot

Experimenting with Isabelle in ZF set theory

inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot

Set theory for verification: I. From foundations to functions

inferred← citeshttps://doi.org/10.1007/bfb0012848openalex-snapshot

Term rewriting: Some experimental results

inferred← citeshttps://doi.org/10.1007/bfb0013178openalex-snapshot

Decision procedures for set/hyperset contexts

inferred← citeshttps://doi.org/10.1007/bfb0105406openalex-snapshot

A mizar mode for HOL

inferred← citeshttps://doi.org/10.1007/s10817-009-9143-8openalex-snapshot

The TPTP Problem Library and Associated Infrastructure

inferred← citeshttps://doi.org/10.1007/s10817-012-9272-3openalex-snapshot

Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

inferred← citeshttps://doi.org/10.1007/s11424-026-5318-1openalex-snapshot

A Comparative Review of ZFC, NBG, and MK Axiom Systems: Theoretical Foundations and Formalization in Coq

inferred← citeshttps://doi.org/10.1016/0303-2647(94)01453-eopenalex-snapshot

A precondition prover for analogy

inferred← citeshttps://doi.org/10.1016/b978-0-934613-67-5.50017-4openalex-snapshot

A Survey of Automated Deduction11This is an enlarged version of a survey talk given by Woody Bledsoe at the Sixth National Conference on Artificial Intelligence, Seattle, Washington, July 16, 1987.

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot

Classical Type Theory

inferred← citeshttps://doi.org/10.1016/s0096-3003(99)00249-0openalex-snapshot

The application of automated reasoning to formal models of combinatorial optimization

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10012-2openalex-snapshot

Set constructors, finite sets, and logical semantics

inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00023-3openalex-snapshot

Computer proofs about finite and regular sets: the unifying concept of subvariance

inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80009-xopenalex-snapshot

A derived algorithm for evaluating ɛ-expressions over abstract sets

inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80136-8openalex-snapshot

Term rewriting: Some experimental results

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00147-1openalex-snapshot

Layered map reasoning

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80656-xopenalex-snapshot

Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs

inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot

Chapter 1 Knowledge Representation and Classical Logic

inferred← citeshttps://doi.org/10.1023/a:1005806324129openalex-snapshot

The TPTP Problem Library

inferred← citeshttps://doi.org/10.1023/a:1006010913494openalex-snapshot

On Computer-Assisted Proofs in Ordinal Number Theory

inferred← citeshttps://doi.org/10.1023/a:1006050629424openalex-snapshot

Computer Proofs in Gödel’s Class Theory with Equational Definitions for Composite and Cross

inferred← citeshttps://doi.org/10.1109/skg.2007.178openalex-snapshot

A Semilattice Model for the Theory Grid

inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot

Automated deduction for verification

inferred← citeshttps://doi.org/10.1305/ndjfl/1040149359openalex-snapshot

A Finitely Axiomatized Formalization of Predicate Calculus with Equality

inferred← citeshttps://doi.org/10.18489/sacj.v45i0.33openalex-snapshot

Formal methods in software development: A road less travelled

inferred← citeshttps://doi.org/10.48456/tr-286openalex-snapshot

Isabelle’s object-logics

inferred← citeshttps://doi.org/10.5220/0002425900430052openalex-snapshot

Validating Reasoning Heuristics Using Next-Generation Theorem-Provers

inferred← citeshttps://doi.org/10.5281/zenodo.26327openalex-snapshot

Woitkowskia, A New Genus Of Army Ants.

inferred← citeshttps://doi.org/10.5555/1035053.1035061openalex-snapshot

Evaluating reasoning heuristics in the context of multi-level marketing structures

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.