On the public citation graph
Non-extensional type-free theories of partial operations and classifications, I
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19750210158openalex-snapshot
A note on the predicatively definable sets of N. N. Nepeîvoda
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1016/s0049-237x(08)70892-9openalex-snapshot
A System of Axiomatic Set Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71229-1openalex-snapshot
Axiomatic Recursive Function Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1017/s0022481200040135openalex-snapshot
A system of axiomatic set theory—Part I
inferredcites →https://doi.org/10.1090/pspum/013.2/0360271openalex-snapshot
The consistency of partial set theory without extensionality
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1111/j.1755-2567.1966.tb00600.xopenalex-snapshot
First Order Predicate Logic with Generalized Quantifiers
inferredcites →https://doi.org/10.2307/2272708openalex-snapshot
Bertrand Russell. Mathematical logic as based on the theory of types. A reprint of the first five sections of 11116. Contemporary readings in logical theory, edited by Irving M. Copi and James A. Gould, The Macmillan Company, New York, and Collier-Macmillan Limited, London, 1967, pp. 135–153.
inferredcites →https://doi.org/10.2307/2369948openalex-snapshot
Mathematical Logic as Based on the Theory of Types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19820281902openalex-snapshot
Some Results in Aczel‐Feferman Logic and Set Theory
inferred← citeshttps://doi.org/10.1002/malq.19870330511openalex-snapshot
A Possible Modal Formulation of Comprehension Scheme
inferred← citeshttps://doi.org/10.1002/malq.19890350202openalex-snapshot
Notes on Formal Theories of Truth
inferred← citeshttps://doi.org/10.1007/3-540-19129-1_1openalex-snapshot
Rum an intensional theory of function and control abstractions
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3openalex-snapshot
Feferman on Foundations - Logic, Mathematics, Philosophy
inferred← citeshttps://doi.org/10.1007/978-94-009-1171-0_10openalex-snapshot
Semantics and the Liar Paradox
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_9openalex-snapshot
Categorical Foundations and Foundations of Category Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0466-3_3openalex-snapshot
Semantics and the Liar Paradox
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_1openalex-snapshot
Operations, Collections and Sets within a General Axiomatic Framework
inferred← citeshttps://doi.org/10.1007/bf00453022openalex-snapshot
Paradox, truth and logic part I: Paradox and truth
inferred← citeshttps://doi.org/10.1007/bfb0032398openalex-snapshot
The logic of FOL systems: Formulated in set theory
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70020-2openalex-snapshot
Paradoxes, Self-Reference and Truth in the 20th Century
inferred← citeshttps://doi.org/10.1017/9781316755983.013openalex-snapshot
On extensionality, uniformity and comprehension in the theories of operations and classes
inferred← citeshttps://doi.org/10.1017/s0960129597002272openalex-snapshot
An axiomatization of partial n-place operations
inferred← citeshttps://doi.org/10.1080/0020174x.2013.855657openalex-snapshot
The Groundedness Approach to Class Theory
inferred← citeshttps://doi.org/10.1515/9783112720875openalex-snapshot
A Model Theoretic Oriented Approach to Partial Algebras
inferred← citeshttps://doi.org/10.2307/2273420openalex-snapshot
A consistent combinatory logic with an inverse to equality
inferred← citeshttps://doi.org/10.2307/2275216openalex-snapshot
Extending the first-order theory of combinators with self-referential truth
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.