On the public citation graph

On connections and higher-order logic

https://doi.org/10.1007/bf00248320
0 signed · 75 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.1007/3-540-10009-1_22openalex-snapshot
Transforming matings into natural deduction proofs
inferredcites →https://doi.org/10.1007/3-540-16780-3_75openalex-snapshot
Connections and higher-order logic
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_22openalex-snapshot
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_23openalex-snapshot
Analytic and Non-analytic Proofs
inferredcites →https://doi.org/10.1007/978-3-322-90100-2openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_20openalex-snapshot
Eliminating the Irrelevant from Mechanical Proofs
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_29openalex-snapshot
Resolution in Type Theory
inferredcites →https://doi.org/10.1007/bf00370646openalex-snapshot
A compact representation of proofs
inferredcites →https://doi.org/10.1007/bfb0060634openalex-snapshot
A proof procedure with matrix reduction
inferredcites →https://doi.org/10.1016/0004-3702(76)90021-7openalex-snapshot
Refutation graphs
inferredcites →https://doi.org/10.1016/0004-3702(82)90024-8openalex-snapshot
A comparative study of several proof procedures
inferredcites →https://doi.org/10.1016/0167-739x(85)90019-6openalex-snapshot
Towards a connection machine for logical inference
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(76)90021-9openalex-snapshot
Mechanizing ω-order type theory through unification
inferredcites →https://doi.org/10.1016/0304-3975(79)90054-9openalex-snapshot
Tautology testing with a generalized matrix reduction method
inferredcites →https://doi.org/10.1016/0376-5075(81)90061-1openalex-snapshot
1981 international computing symposium
inferredcites →https://doi.org/10.1090/conm/029/09openalex-snapshot
Automating Higher-Order Logic
inferredcites →https://doi.org/10.1090/psapm/015/0170497openalex-snapshot
Eliminating the irrelevant from mechanical proofs
inferredcites →https://doi.org/10.1090/s0002-9904-1963-10990-8openalex-snapshot
False lemmas in Herbrand
inferredcites →https://doi.org/10.1109/tc.1976.1674698openalex-snapshot
Refutations by Matings
inferredcites →https://doi.org/10.1145/182.183openalex-snapshot
Matings in matrices
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1145/322276.322277openalex-snapshot
On Matrices with Connections
inferredcites →https://doi.org/10.1305/ndjfl/1093891200openalex-snapshot
Resolution and the consistency of analysis.
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2269949openalex-snapshot
Resolution in type theory
inferredcites →https://doi.org/10.2307/2270454openalex-snapshot
A supplement to Herbrand
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.

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_44openalex-snapshot
Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic
inferred← citeshttps://doi.org/10.1007/11532231_3openalex-snapshot
Reasoning in Extensional Type Theory with Equality
inferred← citeshttps://doi.org/10.1007/11541868_5openalex-snapshot
A Structured Set of Higher-Order Problems
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_128openalex-snapshot
The TPS theorem proving system
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_33openalex-snapshot
Solving for Set Variables in Higher-Order Theorem Proving
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-52885-7_104openalex-snapshot
Perspectives on automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_120openalex-snapshot
The TPS theorem proving system
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_98openalex-snapshot
Presenting intuitive deductions via symmetric simplification
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_148openalex-snapshot
TPS: An interactive and automatic tool for proving theorems of type theory
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_43openalex-snapshot
Higher-order tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_48openalex-snapshot
Analytica — An experiment in combining theorem proving and symbolic computation
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_4openalex-snapshot
Superposition with Lambdas
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_33openalex-snapshot
Prolog Technology Reinforcement Learning Prover
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_16openalex-snapshot
A Combinator-Based Superposition Calculus for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_23openalex-snapshot
Superposition for Full Higher-order Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_5openalex-snapshot
Finding Connections via Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_1openalex-snapshot
A Vision for Automated Deduction Rooted in the Connection Method
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_8openalex-snapshot
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_4openalex-snapshot
Perspectives on Automated Deduction
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bfb0054248openalex-snapshot
Extensional higher-order resolution
inferred← citeshttps://doi.org/10.1007/bfb0054272openalex-snapshot
Selectively instantiating definitions
inferred← citeshttps://doi.org/10.1007/s10817-015-9348-yopenalex-snapshot
The Higher-Order Prover Leo-II
inferred← citeshttps://doi.org/10.1007/s10817-020-09576-7openalex-snapshot
Machine Learning Guidance for Connection Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-021-09595-yopenalex-snapshot
Superposition with Lambdas
inferred← citeshttps://doi.org/10.1007/s10817-022-09649-9openalex-snapshot
Superposition for Higher-Order Logic
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-444-51624-4.50005-8openalex-snapshot
Automation of Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
inferred← citeshttps://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferred← citeshttps://doi.org/10.1023/a:1020840027781openalex-snapshot
Comparing Approaches To Resolution Based Higher-Order Theorem Proving
inferred← citeshttps://doi.org/10.1093/jigpal/jzac082openalex-snapshot
Who finds the short proof?
inferred← citeshttps://doi.org/10.1093/jigpal/jzp080openalex-snapshot
Multimodal and intuitionistic logics in simple type theory
inferred← citeshttps://doi.org/10.1093/oso/9780198537922.003.0011openalex-snapshot
Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1515/opphil-2019-0015openalex-snapshot
Computer Science and Metaphysics: A Cross-Fertilization
inferred← citeshttps://doi.org/10.1609/aimag.v37i2.2620openalex-snapshot
The CADE ATP System Competition — CASC
inferred← citeshttps://doi.org/10.2178/jsl/1102022211openalex-snapshot
Higher-order semantics and extensionality
inferred← citeshttps://doi.org/10.22028/d291-25745openalex-snapshot
Omega-ants: A blackboard architecture for the integration of reasoning techniques into proof planning
inferred← citeshttps://doi.org/10.2307/2275205openalex-snapshot
Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991
inferred← citeshttps://doi.org/10.29007/lvccopenalex-snapshot
Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03107openalex-snapshot
Machine Learning Guidance and Proof Certification for Connection Tableaux
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00453openalex-snapshot
Superposition with Lambdas
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1710openalex-snapshot
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
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.