The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A lattice-theoretical fixpoint theorem and its applications
Open accessAbstract
Most of the results contained in this paper were obtained in 1939.A summary of the results was given in [6].The paper was prepared for publication when the author was working on a research project in the foundations of mathematics sponsored by the Office of Ordnance Research, U.S. Army.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The generalized simplex method for minimizing a linear form under linear inequality restraints
Dantzig, G., Orden, A., & Wolfe, P. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.183 · Cited by 585
Phillips, R. S. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.269 · Cited by 85
Cited by
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
Milgrom, P., & Roberts, J. (1990) · Econometrica · doi:10.2307/2938316 · Cited by 1,804
Minimizing a Submodular Function on a Lattice
Topkis, D. M. (1978) · Operations Research · doi:10.1287/opre.26.2.305 · Cited by 1,315
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
Knowledge and common knowledge in a distributed environment
Halpern, J. Y., & Moses, Y. (1990) · Journal of the ACM · doi:10.1145/79147.79161 · Cited by 955
Using branching time temporal logic to synthesize synchronization skeletons
Emerson, E. A., & Clarke, E. M. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90017-5 · Cited by 660
What Happens When Wal-Mart Comes to Town: An Empirical Analysis of the Discount Retailing Industry
(2008) · Econometrica · doi:10.3982/ecta6649 · Cited by 655
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
The generalized simplex method for minimizing a linear form under linear inequality restraints
Dantzig, G., Orden, A., & Wolfe, P. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.183 · Cited by 585
Abstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
Game Theory in Supply Chain Analysis
Cachon, G. P., & Netessine, S. (2004) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4020-7953-5_2 · Cited by 567
A kripke-kleene semantics for logic programs*
Fitting, M. (1985) · The Journal of Logic Programming · doi:10.1016/s0743-1066(85)80005-4 · Cited by 534
Contagion in Financial Networks
Glasserman, P., & Young, H. P. (2016) · Journal of Economic Literature · doi:10.1257/jel.20151228 · Cited by 525
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
Representing action and change by logic programs
Gelfond, M., & Lifschitz, V. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90035-f · Cited by 507
ConGolog, a concurrent programming language based on the situation calculus
De Giacomo, G., Lespérance, Y., & Levesque, H. J. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00031-x · Cited by 494
Recursive smooth ambiguity preferences
Klibanoff, P., Marinacci, M., & Mukerji, S. (2009) · Journal of Economic Theory · doi:10.1016/j.jet.2008.10.007 · Cited by 392
Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions
Roth, A. (2007) · National Bureau of Economic Research · doi:10.3386/w13225 · Cited by 392
Deferred acceptance algorithms: history, theory, practice, and open questions
Roth, A. E. (2008) · International Journal of Game Theory · doi:10.1007/s00182-008-0117-6 · Cited by 372
A Fixed-Point Approach to Stable Matchings and Some Applications
Fleiner, T. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.103.14256 · Cited by 291
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00457ed1v01y201211aim019 · Cited by 288
The Rise of Mass Consumption Societies
Matsuyama, K. (2002) · Journal of Political Economy · doi:10.1086/341873 · Cited by 270
Constructive versions of Tarski’s fixed point theorems
Cousot, P., & Cousot, R. (1979) · Pacific Journal of Mathematics · doi:10.2140/pjm.1979.82.43 · Cited by 254
(2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 126
Computable Functions in ASP: Theory and Implementation
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89982-2_37 · Cited by 120
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
A model of online misinformation
Acemoglu, D., Ozdaglar, A., & Siderius, J. (2024) · Review of Economic Studies · doi:10.1093/restud/rdad111 · Cited by 82
Circular Rhetoric and Paradox in 1 John 3:9
Min, R. K. (2017) · Neotestamentica · doi:10.1353/neo.2017.0004 · Cited by 1
Metadata
- Authors
- Tarski, A.
- Venue
- Pacific Journal of Mathematics
- Publisher
- Mathematical Sciences Publishers
- Published
- 1955-06-01
- Volume
- 5
- Issue
- 2
- Pages
- 285-309
- ISSN
- 0030-8730 (ISSN-L)
- OpenAlex
- W2046213250
- Cited by
- 2,704
- References
- 2
- FWCI
- 15.13
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.