On the public citation graph

Some Theorems on Deducibility

https://doi.org/10.2307/1968352

0 signed · 78 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19860322514openalex-snapshot

Relations Intrinsically Recursive in Linear Orders

inferred← citeshttps://doi.org/10.1007/3-540-45004-1_20openalex-snapshot

Reasoning about Cyclic Space: Axiomatic and Computational Aspects

inferred← citeshttps://doi.org/10.1007/3-540-53863-1_22openalex-snapshot

Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows

inferred← citeshttps://doi.org/10.1007/3-540-62501-1_25openalex-snapshot

Computing the well-founded semantics for constraint extensions of datalog⌝

inferred← citeshttps://doi.org/10.1007/978-3-030-56554-1openalex-snapshot

Decidability of Logical Theories and Their Combination

inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot

La Logique Mathématique en sa jeunesse

inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_3openalex-snapshot

The Lattice of Definability. Origins, Recent Developments, and Further Directions

inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_3openalex-snapshot

Linear Quantifier Elimination

inferred← citeshttps://doi.org/10.1007/978-94-007-0080-2_4openalex-snapshot

A Visit to Tarski’s Seminar on Elimination of Quantifiers

inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_1openalex-snapshot

Elementary Predicate Logic

inferred← citeshttps://doi.org/10.1007/978-94-015-9833-0_1openalex-snapshot

Elementary Predicate Logic

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

Definability, decidability, complexity

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

Constraint databases: A survey

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

Reminiscences of logicians

inferred← citeshttps://doi.org/10.1007/s10817-010-9183-0openalex-snapshot

Linear Quantifier Elimination

inferred← citeshttps://doi.org/10.1007/s11229-015-0877-zopenalex-snapshot

Carnap’s early metatheory: scope and limits

inferred← citeshttps://doi.org/10.1007/s11787-012-0058-5openalex-snapshot

On Rereading van Heijenoort’s Selected Essays

inferred← citeshttps://doi.org/10.1016/0097-3165(76)90055-8openalex-snapshot

Fourier-Motzkin elimination extension to integer programming problems

inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0359-6openalex-snapshot

Logic applied to integer programming and integer programming applied to logic

inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot

A BIBLIOGRAPHY OF THE THEORY OF MODELS

inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.003openalex-snapshot

Constants and finite unary relations in qualitative constraint reasoning

inferred← citeshttps://doi.org/10.1016/j.exmath.2010.09.004openalex-snapshot

The axiomatics of ordered geometry

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70087-9openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70411-7openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71439-3openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70115-6openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot

Chapter 14 Computability theory and linear orderings

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00281-8openalex-snapshot

On arithmetical first-order theories allowing encoding and decoding of lists

inferred← citeshttps://doi.org/10.1016/s1385-7258(54)50058-2openalex-snapshot

Applications of the Löwenheim–Skolem–Tarski Theorem to Problems of Completeness and Decidability

inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70015-9openalex-snapshot

Tarski’s Logic

inferred← citeshttps://doi.org/10.1017/s0022481200028905openalex-snapshot

Alfred Tarski and decidable theories

inferred← citeshttps://doi.org/10.1017/s0022481200028917openalex-snapshot

Alfred Tarski's work on general metamathematics

inferred← citeshttps://doi.org/10.1017/s096012951600030xopenalex-snapshot

Autostability spectra for decidable structures

inferred← citeshttps://doi.org/10.1057/jors.2015.72openalex-snapshot

The dependency diagram of a linear programme

inferred← citeshttps://doi.org/10.1057/jors.2016.45openalex-snapshot

The dependency diagram of a mixed integer linear programme

inferred← citeshttps://doi.org/10.1080/00029890.1986.11971923openalex-snapshot

Fourier's Method of Linear Programming and Its Dual

inferred← citeshttps://doi.org/10.1080/01445340.2011.592261openalex-snapshot

Henry M. Sheffer and Notational Relativity

inferred← citeshttps://doi.org/10.1080/01445340310001599588openalex-snapshot

American Postulate Theorists and Alfred Tarski

inferred← citeshttps://doi.org/10.1090/s0002-9904-1927-04494-9openalex-snapshot

Thirty-sixth annual list of papers

inferred← citeshttps://doi.org/10.1090/s0002-9947-1960-0114855-0openalex-snapshot

Elementary Properties of Ordered Abelian Groups

inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0148547-1openalex-snapshot

Limit Ultrapowers

inferred← citeshttps://doi.org/10.1090/s0002-9947-1986-0833697-xopenalex-snapshot

Definable Sets in Ordered Structures. I

inferred← citeshttps://doi.org/10.1093/acprof:oso/9780195137316.003.0029openalex-snapshot

The Development of Mathematical Logic from Russell to Tarski, 1900–1935

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.001.0001openalex-snapshot

Philosophy and Model Theory

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.002.0003openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0001openalex-snapshot

Logics and languages

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0002openalex-snapshot

Permutations and referential indeterminacy

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0003openalex-snapshot

Ramsey sentences and Newman’s objection

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0004openalex-snapshot

Compactness, infinitesimals, and the reals

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0005openalex-snapshot

Sameness of structure and theory

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0006openalex-snapshot

Modelism and mathematical doxology

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0007openalex-snapshot

Categoricity and the natural numbers

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0008openalex-snapshot

Categoricity and the sets

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0009openalex-snapshot

Transcendental arguments against model-theoretical scepticism

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0010openalex-snapshot

Internal categoricity and the natural numbers

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0011openalex-snapshot

Internal categoricity and the sets

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0012openalex-snapshot

Internal categoricity and truth

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0013openalex-snapshot

Boolean-valued structures

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0014openalex-snapshot

Types and Stone spaces

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0015openalex-snapshot

Indiscernibility

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0016openalex-snapshot

Quantifiers

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0017openalex-snapshot

Classification and uncountable categoricity

inferred← citeshttps://doi.org/10.1093/oso/9780198790396.003.0018openalex-snapshot

Wilfrid Hodges A short history of model theory

inferred← citeshttps://doi.org/10.1134/s0037446626030134openalex-snapshot

Weihrauch Complexity for Elementary Embeddings into Countable Saturated Models

inferred← citeshttps://doi.org/10.1134/s1064562423700370openalex-snapshot

The Lattice of Definability: Origins, Recent Developments, and Further Directions

inferred← citeshttps://doi.org/10.12794/metadc5387openalex-snapshot

A Computation of Partial Isomorphism Rank on Ordinal Structures

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

The elementary theory of the natural lattice is finitely axiomatizable.

inferred← citeshttps://doi.org/10.21146/2074-1472-2012-18-0-239-272openalex-snapshot

How Peircean was the “‘Fregean’ Revolution” in Logic?

inferred← citeshttps://doi.org/10.2178/bsl/1140640942openalex-snapshot

What is Tarski'sCommonConcept of Consequence?

inferred← citeshttps://doi.org/10.2178/bsl/1333560806openalex-snapshot

On Tarski's Foundations of the Geometry of Solids

inferred← citeshttps://doi.org/10.22405/2226-8383-2021-22-1-304-327openalex-snapshot

The lattice of definability. Origins and Directions of Research

inferred← citeshttps://doi.org/10.2307/2273900openalex-snapshot

Alfred Tarski's work in model theory

inferred← citeshttps://doi.org/10.2307/2687766openalex-snapshot

2000-2001 Winter Meeting of the Association for Symbolic Logic

inferred← citeshttps://doi.org/10.2307/421074openalex-snapshot

Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski

inferred← citeshttps://doi.org/10.2307/421156openalex-snapshot

American Logic in the 1920s

inferred← citeshttps://doi.org/10.3390/philosophies8020022openalex-snapshot

Turing and Von Neumann: From Logic to the Computer

inferred← citeshttps://doi.org/10.48550/arxiv.1201.0353openalex-snapshot

How Peircean was the "'Fregean' Revolution" in Logic?

inferred← citeshttps://doi.org/10.58837/chula.the.2020.297openalex-snapshot

Definable modules over definable rings without zero divisors in o-minimal 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.