language:
Find link is a tool written by Edward Betts.searching for Journal of Symbolic Logic 259 found (589 total)
alternate case: journal of Symbolic Logic
George Boolos
(2,176 words)
[view diff]
exact match in snippet
view article
find links to article
"Degrees of unsolvability of constructible sets of integers," Journal of Symbolic Logic 33: 497–513. 1969, "Effectiveness and natural languages" in SidneyR. R. Rockingham Gill (251 words) [view diff] exact match in snippet view article find links to article
the University of St Andrews and has published variously in the Journal of Symbolic Logic, Archiv für mathematische Logik und Grundlagenforschung (ArchiveReinhardt cardinal (812 words) [view diff] exact match in snippet view article find links to article
embeddings and infinitary combinatorics", Journal of Symbolic Logic, 36 (3), The Journal of Symbolic Logic, Vol. 36, No. 3: 407–413, doi:10.2307/2269948Gholamhossein Mosahab (494 words) [view diff] exact match in snippet view article find links to article
work was given a positive review in 1957 by L. A. Zadeh in the Journal of Symbolic Logic. Mosahab's most famous work in non-mathematical society is asMorass (set theory) (888 words) [view diff] exact match in snippet view article
Simplified Morasses, Journal of Symbolic Logic 49, No. 1 (1984), pp 257–271. D. Velleman. Simplified Morasses, Journal of Symbolic Logic 49, No. 1 (1984)Gödel Lecture (586 words) [view diff] exact match in snippet view article find links to article
Meeting of the Association for Symbolic Logic: Berkeley, 1990". The Journal of Symbolic Logic. 56 (1): 361–371. doi:10.2307/2274945. ISSN 0022-4812. MoreoverSelf-verifying theories (419 words) [view diff] exact match in snippet view article find links to article
Incompleteness Theorem and Related Reflection Principles". The Journal of Symbolic Logic. 66 (2): 536–596. doi:10.2307/2695030. JSTOR 2695030. S2CID 2822314Arnold Oberschelp (704 words) [view diff] exact match in snippet view article find links to article
(June 1968). "On the Craig-Lyndon Interpolation Theorem". The Journal of Symbolic Logic. 33 (2): 271–274. doi:10.2307/2269873. JSTOR 2269873. S2CID 30465874Anne Sjerp Troelstra (260 words) [view diff] exact match in snippet view article find links to article
(1996), "Review: Lectures on Linear Logic by A. S. Troelstra", Journal of Symbolic Logic, 61 (1): 336–38, doi:10.2307/2275616, JSTOR 2275616, S2CID 117923544Tarski's World (314 words) [view diff] exact match in snippet view article find links to article
Including the IBM-Compatible Windows Version of Tarski's World 4.0. Journal of Symbolic Logic, 64, 2, 916–918. Compton, K. J., (1993). Review of The LanguageAndrzej Mostowski (826 words) [view diff] exact match in snippet view article find links to article
(1951). Andrzej Mostowski, "On direct products of theories", Journal of Symbolic Logic, Vol. 17, No. 1, ss. 1-31, (1952). Andrzej Mostowski, "ModelsAnne C. Morel (985 words) [view diff] exact match in snippet view article find links to article
untitled periodical (link) Oberschelp, Arnold (September 1966), Journal of Symbolic Logic, 31 (3): 506–507, doi:10.2307/2270485, JSTOR 2270485{{citation}}:Proper forcing axiom (895 words) [view diff] exact match in snippet view article find links to article
Suslin's hypothesis, a non-special Aronszajn tree, and GCH", (1994), Journal of Symbolic Logic (59) pp. 1–29 Jech, Thomas (2002). Set theory (Third millenniumJean E. Rubin (590 words) [view diff] exact match in snippet view article find links to article
untitled periodical (link) Pincus, David (September 1987), The Journal of Symbolic Logic, 52 (3): 867–869, doi:10.2307/2274372, JSTOR 2274372{{citation}}:Vladimir Kanovei (388 words) [view diff] exact match in snippet view article find links to article
forcing. Journal of Symbolic Logic 64 (1999), no. 2, 551–574. Kanovei, Vladimir; Shelah, Saharon; A definable nonstandard model of the reals. Journal of SymbolicFrederick Rowbottom (402 words) [view diff] exact match in snippet view article find links to article
S2CID 120998636. Feng, Qi (1987), "On the Rowbottom M-ultrafilters", Journal of Symbolic Logic, 52 (4): 990–993, doi:10.2307/2273832, JSTOR 2273832. RowbottomOrdinal analysis (4,946 words) [view diff] exact match in snippet view article find links to article
G. Jäger, "The Strength of Admissibility Without Foundation". Journal of Symbolic Logic vol. 49, no. 3 (1984). B. Afshari, M. Rathjen, "Ordinal AnalysisSlow-growing hierarchy (813 words) [view diff] exact match in snippet view article find links to article
(1983). "The slow-growing and the Grzegorczyk hierarchies". The Journal of Symbolic Logic. 48 (2): 399–408. doi:10.2307/2273557. ISSN 0022-4812. JSTOR 2273557Lennart Åqvist (524 words) [view diff] exact match in snippet view article find links to article
Results Concerning Some Modal Systems That Contain S. (1964) Journal of Symbolic Logic 29 (2). A Solution to Moore's Paradox. (1964) Philosophical StudiesAlgorithm (6,770 words) [view diff] exact match in snippet view article find links to article
Church, Alonzo (1936). "A Note on the Entscheidungsproblem". The Journal of Symbolic Logic. 1 (1): 40–41. doi:10.2307/2269326. JSTOR 2269326. S2CID 42323521Algorithm (6,770 words) [view diff] exact match in snippet view article find links to article
Church, Alonzo (1936). "A Note on the Entscheidungsproblem". The Journal of Symbolic Logic. 1 (1): 40–41. doi:10.2307/2269326. JSTOR 2269326. S2CID 42323521Huge cardinal (900 words) [view diff] exact match in snippet view article find links to article
ISBN 3-540-00384-3. Kunen, Kenneth (1978), "Saturated ideals", The Journal of Symbolic Logic, 43 (1): 65–76, doi:10.2307/2271949, ISSN 0022-4812, JSTOR 2271949Joel David Hamkins (1,791 words) [view diff] exact match in snippet view article find links to article
(1998). "Small Forcing Makes any Cardinal Superdestructible". The Journal of Symbolic Logic. 63 (1): 51–58. arXiv:1607.00684. doi:10.2307/2586586. JSTOR 2586586Ronald Fagin (1,179 words) [view diff] exact match in snippet view article find links to article
ISBN 978-3-540-21202-7. Ronald Fagin: "Probabilities on Finite Models". Journal of Symbolic Logic, 41(1):50-58, 1976 Glebskiĭ, Y. V.; Kogan, D. I.; Liogonkiĭ, MMaximal set (347 words) [view diff] exact match in snippet view article find links to article
II. Maximal set. III. Enumeration without duplication", The Journal of Symbolic Logic, 23 (3), Association for Symbolic Logic: 309–316, doi:10.2307/2964290Iterable cardinal (207 words) [view diff] exact match in snippet view article find links to article
ω1-iterability.) Gitman, Victoria (2011), "Ramsey-like cardinals I", Journal of Symbolic Logic, 76 (2): 519–540, arXiv:0801.4723, doi:10.2178/jsl/1305810762Disjunction and existence properties (1,178 words) [view diff] exact match in snippet view article find links to article
1945, "On the interpretation of intuitionistic number theory," Journal of Symbolic Logic, v. 10, pp. 109–124. Ulrich Kohlenbach, 2008, Applied proof theoryPenelope Maddy (1,069 words) [view diff] exact match in snippet view article find links to article
ZFC. Maddy, Penelope (June 1988). "Believing the Axioms, I". Journal of Symbolic Logic. 53 (2): 481–511. doi:10.2307/2274520. JSTOR 2274520. (a copyLarge cardinal (1,337 words) [view diff] exact match in snippet view article find links to article
I". Journal of Symbolic Logic. 53 (2): 481–511. doi:10.2307/2274520. JSTOR 2274520. Maddy, Penelope (1988). "Believing the Axioms, II". Journal of SymbolicThomas Forster (mathematician) (472 words) [view diff] exact match in snippet view article
November 2020. Review of Quine's New Foundations: Urs Oswald, The Journal of Symbolic Logic, doi:10.2307/2274242, JSTOR 2274242 Reviews of Set Theory withPetr Vopěnka (878 words) [view diff] exact match in snippet view article find links to article
Alternative set Theory by Petr Vopenka". The Journal of Symbolic Logic. 49 (4). The Journal of Symbolic Logic, Vol. 49, No. 4: 1423–1424. doi:10.2307/2274302James F. Thomson (philosopher) (657 words) [view diff] exact match in snippet view article
Journal of Symbolic Logic, 1953 Tasks and super-tasks. Analysis, 1954 Recent Criticisms of Russell's Analysis of Existence. The Journal of Symbolic LogicGiorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article
Japaridze, "Towards applied theories based on computability logic". Journal of Symbolic Logic 75 (2010), pages 565-601. G. Japaridze, "Many concepts and twoAlice ter Meulen (730 words) [view diff] exact match in snippet view article find links to article
Linguistics, doi:10.1017/S0008413100014857; Lawrence S. Moss, Journal of Symbolic Logic, doi:10.2307/2275199, JSTOR 2275199; Geoffrey K. Pullum, JournalWadge hierarchy (1,336 words) [view diff] exact match in snippet view article find links to article
"Monotone Reducibility and the Family of Infinite Sets". The Journal of Symbolic Logic. 49 (3). Association for Symbolic Logic: 774–782. doi:10.2307/2274130Inner model (587 words) [view diff] exact match in snippet view article find links to article
Shepherdson, J.C. (1951–53). "Inner Models for Set Theory" (Document). Journal of Symbolic Logic. Jech, Thomas (2002). Set Theory. Berlin: Springer-Verlag. ISBN 3-540-44085-2Frege system (912 words) [view diff] exact match in snippet view article find links to article
"The relative efficiency of propositional proof systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702Imaginary element (300 words) [view diff] exact match in snippet view article find links to article
théorie de Galois imaginaire. [An imaginary Galois theory]", Journal of Symbolic Logic, 48 (4): 1151–1170, doi:10.2307/2273680, JSTOR 2273680, MR 0727805Amorphous set (651 words) [view diff] exact match in snippet view article find links to article
Plotkin, Jacob Manuel (November 1969), "Generic Embeddings", The Journal of Symbolic Logic, 34 (3): 388–394, doi:10.2307/2270904, ISSN 0022-4812, JSTOR 2270904Akihiro Kanamori (248 words) [view diff] exact match in snippet view article find links to article
Joel David Hamkins, Studia Logica, JSTOR 20016207 Azriel Lévy, Journal of Symbolic Logic, doi:10.2307/2275615, JSTOR 2275615 Pierre Matet, MR1321144 MCurry's paradox (2,430 words) [view diff] exact match in snippet view article find links to article
(Sep 1942). "The Inconsistency of Certain Formal Logics". The Journal of Symbolic Logic. 7 (3): 115–117. doi:10.2307/2269292. JSTOR 2269292. S2CID 121991184Church–Turing thesis (6,736 words) [view diff] exact match in snippet view article find links to article
Church, Alonzo (June 1936b). "A Note on the Entscheidungsproblem". Journal of Symbolic Logic. 1 (1): 40–41. doi:10.2307/2269326. JSTOR 2269326. S2CID 42323521Necessity of identity (831 words) [view diff] exact match in snippet view article find links to article
Second Order’, Journal of Symbolic Logic, 1947, 12-15. Quine, W.V.O., ‘Three Grades of Modal Involvement’, Journal of Symbolic Logic, 1953, 168-169.Friedberg numbering (114 words) [view diff] exact match in snippet view article find links to article
Decomposition. II. Maximal Set. III. Enumeration Without Duplication, Journal of Symbolic Logic 23:3, pp. 309–316. Nikolaj K. Vereščagin and A. Shen (2003), ComputableBranching quantifier (1,543 words) [view diff] exact match in snippet view article find links to article
42/26312. citing W. Walkoe, Finite partially-ordered quantification, Journal of Symbolic Logic 35 (1970) 535–555. JSTOR 2271440 Hintikka, J. (1973). "QuantifiersSecond-order propositional logic (121 words) [view diff] exact match in snippet view article find links to article
normalisation for second order classical natural deduction". Journal of Symbolic Logic. 62 (4) (published 12 March 2014): 1461–1479. doi:10.2307/2275652Witness (mathematics) (492 words) [view diff] exact match in snippet view article
1949, "The completeness of the first-order functional calculus", Journal of Symbolic Logic v. 14 n. 3, pp. 159–166. Peter G. Hinman, 2005, Fundamentals ofWarren Goldfarb (369 words) [view diff] exact match in snippet view article find links to article
2003. "Logic in the Twenties: the Nature of the Quantifier," The Journal of Symbolic Logic (1979) "I want you to bring me a slab: Remarks on the openingSet Theory: An Introduction to Independence Proofs (197 words) [view diff] exact match in snippet view article find links to article
An Introduction to Independence Proofs by Kenneth Kunen". The Journal of Symbolic Logic. 51 (2): 462–464. doi:10.2307/2274070. JSTOR 2274070. Henson,Class logic (946 words) [view diff] exact match in snippet view article find links to article
Burali-Forti paradox. In: Journal of Symbolic Logic, Band 7, 1942, p. 1-17 Hao Wang: A formal system for logic. In: Journal of Symbolic Logic, Band 15, 1950, pL. T. F. Gamut (207 words) [view diff] exact match in snippet view article find links to article
Volume II. Intensional Logic and Logical, Grammar., L. T. F. Gamut". The Journal of Symbolic Logic. 61 (1): 343–346. doi:10.2307/2275619. JSTOR 2275619.Wilfrid Hodges (365 words) [view diff] exact match in snippet view article find links to article
Leeds, Stephen (1980). "Review of Logic by Wilfrid Hodges". Journal of Symbolic Logic. 45 (2): 382–383. doi:10.2307/2273212. JSTOR 2273212. S2CID 117796294Alexander Esenin-Volpin (2,001 words) [view diff] exact match in snippet view article find links to article
des Fondements des Mathematiques by A. S. Ésénine-Volpine", The Journal of Symbolic Logic, 32 (4), Association for Symbolic Logic: 517, doi:10.2307/2270182De Morgan algebra (1,118 words) [view diff] exact match in snippet view article find links to article
Kleene, S. C. (1938). "On Notation for Ordinal Numbers". The Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. JSTOR 2267778. BrignoleMortality (computability theory) (502 words) [view diff] exact match in snippet view article
problem". Journal of Symbolic Logic. 31 (2): 219–234. doi:10.2307/2269811. Herman, Gabor. "A simple solution of the uniform halting problem". Journal of SymbolicComputational epistemology (1,321 words) [view diff] exact match in snippet view article find links to article
of California Press. Gold, E. M. (1965) "Limiting Recursion", Journal of Symbolic Logic 30: 27-48. Gold, E. Mark (1967), Language Identification in theStrongly minimal theory (405 words) [view diff] exact match in snippet view article find links to article
H. (1971), "On Strongly Minimal Sets", The Journal of Symbolic Logic, 36 (1), The Journal of Symbolic Logic, Vol. 36, No. 1: 79–96, doi:10.2307/2271517John Etchemendy (380 words) [view diff] exact match in snippet view article find links to article
Synthese and Philosophia Mathematica, and a former editor of the Journal of Symbolic Logic. His wife is the writer Nancy Etchemendy and they have one sonJan Łukasiewicz (2,361 words) [view diff] exact match in snippet view article find links to article
paper by Łukasiewicz was reviewed by Henry A. Pogorzelski in the Journal of Symbolic Logic in 1965. In Łukasiewicz's 1951 book, Aristotle's Syllogistic fromEmpty string (687 words) [view diff] exact match in snippet view article find links to article
John; Frank, William; Maloney, Michael (1974). "String theory". Journal of Symbolic Logic. 39 (4): 625–637. doi:10.2307/2272846. JSTOR 2272846. S2CID 2168826Free logic (959 words) [view diff] exact match in snippet view article find links to article
Theodore (1957). "A Theory of Restricted Quantification I". The Journal of Symbolic Logic. 22 (1): 19–35. doi:10.2307/2964055. JSTOR 2964055. S2CID 34062434Concatenation (994 words) [view diff] exact match in snippet view article find links to article
John; Frank, William; Maloney, Michael (1974). "String theory". Journal of Symbolic Logic. 39 (4): 625–637. doi:10.2307/2272846. JSTOR 2272846. S2CID 2168826Mouse (set theory) (213 words) [view diff] exact match in snippet view article
03002. Mitchell, William (1979). "Ramsey cardinals and constructibility". Journal of Symbolic Logic. 44 (2): 260–266. doi:10.2307/2273732. MR 0534574.Raymond Smullyan (2,802 words) [view diff] exact match in snippet view article find links to article
which Self-Reference is Possible", was published in 1957 in the Journal of Symbolic Logic, showing that Gödelian incompleteness held for formal systemsBarcan formula (447 words) [view diff] exact match in snippet view article find links to article
more plausible than the Barcan formula. Commutative property Journal of Symbolic Logic (1946),11 and (1947), 12 under Ruth C. Barcan Barcan both waysLeo Harrington (186 words) [view diff] exact match in snippet view article find links to article
1133–1142 Harrington, L. (1978), "Analytic Determinacy and 0#", Journal of Symbolic Logic, 43 (4): 685–693, doi:10.2307/2273508, JSTOR 2273508, S2CID 46061318Hypercomputation (3,368 words) [view diff] exact match in snippet view article find links to article
1137/S0097539796300921. E. M. Gold (1965). "Limiting Recursion". Journal of Symbolic Logic. 30 (1): 28–48. doi:10.2307/2270580. JSTOR 2270580. S2CID 33811657Forking extension (410 words) [view diff] exact match in snippet view article find links to article
Daniel; Poizat, Bruno (1979), "An Introduction to Forking", The Journal of Symbolic Logic, 44 (3), Association for Symbolic Logic: 330–350, doi:10.2307/2273127Alf Ross (692 words) [view diff] exact match in snippet view article find links to article
661. Hempel, Carl G. (1941). "Alf Ross. Imperatives and Logic". Journal of Symbolic Logic. 6 (3): 105. doi:10.2307/2268596. JSTOR 2268596. S2CID 125238818Primitive recursive function (7,194 words) [view diff] exact match in snippet view article find links to article
Daniel E. (2008), "Unary primitive recursive functions", The Journal of Symbolic Logic, 73 (4): 1122–1138, arXiv:cs/0603063, doi:10.2178/jsl/1230396909Leila Haaparanta (475 words) [view diff] exact match in snippet view article find links to article
curriculum vitae. Reviews of Frege Synthesized: Edwin Martin (1988), Journal of Symbolic Logic, doi:10.2307/2274457, JSTOR 2274457; F. Truyen (1989), TijdschriftBéatrice Longuenesse (1,938 words) [view diff] exact match in snippet view article find links to article
Lambalgen, "A Formalization of Kant's Transcendental Logic," in Journal of Symbolic Logic, 2011, http://philpapers.org/s/T.20Achourioti. T. Achourioti andBéatrice Longuenesse (1,938 words) [view diff] exact match in snippet view article find links to article
Lambalgen, "A Formalization of Kant's Transcendental Logic," in Journal of Symbolic Logic, 2011, http://philpapers.org/s/T.20Achourioti. T. Achourioti andLow basis theorem (570 words) [view diff] exact match in snippet view article find links to article
Petr; Kučera, Antonín (1989). "On Recursion Theory in IΣ1". Journal of Symbolic Logic. 54 (2): 576–589. doi:10.2307/2274871. JSTOR 2274871. S2CID 118808365William S. Hatcher (553 words) [view diff] exact match in snippet view article find links to article
untitled periodical (link) Kroon, Frederick W. (June 1986), The Journal of Symbolic Logic, 51 (2): 467–470, doi:10.2307/2274073, JSTOR 2274073{{citation}}:George F. Simmons (430 words) [view diff] exact match in snippet view article find links to article
Introduction to Topology and Modern Analysis: Perry Smith, The Journal of Symbolic Logic, doi:10.2307/2271489, JSTOR 2271489 Mark Hunacek, MAA ReviewsAlbert A. Mullin (294 words) [view diff] exact match in snippet view article find links to article
contributor to the Journal of the American Mathematical Society, the Journal of Symbolic Logic, and the Notre Dame Journal of Formal Logic. Bronze Star MedalBCK algebra (608 words) [view diff] exact match in snippet view article find links to article
(1970), "Review of several papers on BCI, BCK-Algebras", The Journal of Symbolic Logic, 35 (3): 465–466, doi:10.2307/2270728, ISSN 0022-4812, JSTOR 2270728Conference Board of the Mathematical Sciences (323 words) [view diff] exact match in snippet view article find links to article
"What is the Conference Board of the Mathematical Sciences?", Journal of Symbolic Logic, 43 (3): 620–621, doi:10.1017/S0022481200049495. Conference BoardUltrafinitism (903 words) [view diff] exact match in snippet view article find links to article
des Fondements des Mathematiques by A. S. Ésénine-Volpine", The Journal of Symbolic Logic, 32 (4), Association for Symbolic Logic: 517, doi:10.2307/2270182Chris Freiling (341 words) [view diff] exact match in snippet view article find links to article
"Axioms of symmetry: throwing darts at the real number line", The Journal of Symbolic Logic, 51 (1): 190–200, doi:10.2307/2273955, ISSN 0022-4812, JSTOR 2273955Stephen Cole Kleene (1,356 words) [view diff] exact match in snippet view article find links to article
340–352. 1936. 1938. "On Notations for Ordinal Numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. 1938. doi:10.2307/2267778. JSTOR 2267778. S2CID 34314018Gila Sher (417 words) [view diff] exact match in snippet view article find links to article
Sher, Gila. (1996), Did Tarski Commit Tarski's Fallacy?, The Journal of Symbolic Logic 61, 653-86. Sher, Gila. (1999), Is There a Place for PhilosophyChong Chi Tat (386 words) [view diff] exact match in snippet view article find links to article
injury priority argument. I. Maximal sets and the jump operator. Journal of Symbolic Logic 63 (1998), no. 3, 797–814. Chong received the Pingat PentadbiranCharles Wells (mathematician) (610 words) [view diff] exact match in snippet view article
"Review of Toposes, Triples and Theories by Barr, M., & Wells, C.", Journal of Symbolic Logic, 56 (1): 340–341, doi:10.2307/2274934, JSTOR 2274934 Rota, Gian-CarloHisao Yamada (272 words) [view diff] exact match in snippet view article find links to article
related journals but also in other theoretical journals such as the Journal of Symbolic Logic. Dr. Yamada’s work also played a key role in the early days ofTranscendental number theory (3,907 words) [view diff] exact match in snippet view article find links to article
Marker, D. (2006). "A remark on Zilber's pseudoexponentiation". Journal of Symbolic Logic. 71 (3): 791–798. doi:10.2178/jsl/1154698577. JSTOR 27588482.Greg Hjorth (488 words) [view diff] exact match in snippet view article find links to article
Greg (December 2002). "A dichotomy theorem for turbulence". Journal of Symbolic Logic. 67 (4): 1520–1540. doi:10.2178/jsl/1190150297. ISSN 0022-4812Axiom of adjunction (480 words) [view diff] exact match in snippet view article find links to article
Paul (1937), "A System of Axiomatic Set Theory--Part I", The Journal of Symbolic Logic, 2 (1), Association for Symbolic Logic: 65–77, doi:10.2307/2268862Self-evidence (521 words) [view diff] exact match in snippet view article find links to article
Primitive notion Self-reference Self-refuting idea infinite regress Maddy, Penelope (1988). "Believing the Axioms" (PDF). Journal of Symbolic Logic.Valentin Turchin (1,127 words) [view diff] exact match in snippet view article find links to article
1987). "A constructive interpretation of the full set theory". Journal of Symbolic Logic. 52 (1): 172–201. doi:10.2307/2273872. JSTOR 2273872. S2CID 2205937Bohr compactification (562 words) [view diff] exact match in snippet view article find links to article
(2023). "Bohr compactifications of groups and rings" (PDF). The Journal of Symbolic Logic. 88 (3): 1103–1137. arXiv:2011.04822. doi:10.1017/jsl.2022.10Hardy hierarchy (563 words) [view diff] exact match in snippet view article find links to article
and a refinement of the extended Grzegorczyk hierarchy". The Journal of Symbolic Logic. 37 (2): 281–292. doi:10.2307/2272973. ISSN 0022-4812. JSTOR 2272973Environmental studies (1,237 words) [view diff] exact match in snippet view article find links to article
Smiley, Timothy (1 September 1970). "Form and Content in Logic". Journal of Symbolic Logic. 35 (3): 460–462. doi:10.2307/2270721. ISSN 0022-4812. JSTOR 2270721Axiom of regularity (2,938 words) [view diff] exact match in snippet view article find links to article
Isaac (1941). "A system of axiomatic set theory. Part II". The Journal of Symbolic Logic. 6 (1): 1–17. doi:10.2307/2267281. JSTOR 2267281. S2CID 250344277Ordinal notation (1,889 words) [view diff] exact match in snippet view article find links to article
Kleene, S. C. (1938), "On Notation for Ordinal Numbers", The Journal of Symbolic Logic, 3 (4): 150–155, doi:10.2307/2267778, JSTOR 2267778, S2CID 34314018Eugene P. Northrop (169 words) [view diff] exact match in snippet view article find links to article
Van Nostrand. E. Nagel (1945) Review of Riddles in Mathematics, Journal of Symbolic Logic 10(1), 21. doi:10.2307/2267205 Northrop, Eugene P. (10 June 2014)Gödel's incompleteness theorems (12,115 words) [view diff] exact match in snippet view article find links to article
seriously deficient and received a devastating review in the Journal of Symbolic Logic; "Gödel also complained about Braithwaite's commentary (DawsonHao Wang (academic) (935 words) [view diff] exact match in snippet view article
Robert McNaughton, with a preface by P. Destouches-Fevrier". The Journal of Symbolic Logic. 19 (1): 64. doi:10.2307/2267667. JSTOR 2267667. S2CID 123873097Neil Tennant (philosopher) (301 words) [view diff] exact match in snippet view article
"On the Degeneracy of the Full AGM-Theory of Theory-Revision", Journal of Symbolic Logic, vol. 71, no. 2, pp. 661–676, June 2006. "New Foundations forExponential field (966 words) [view diff] exact match in snippet view article find links to article
David Marker, A remark on Zilber's pseudoexponentiation, The Journal of Symbolic Logic, 71, no.3 (2006), pp. 791–798. A.J. Macintyre, A.J. Wilkie, OnBerry paradox (1,622 words) [view diff] exact match in snippet view article find links to article
D. (1988) "The False Assumption Underlying Berry's Paradox," Journal of Symbolic Logic 53: 1220–1223. Russell, Bertrand (1906) "Les paradoxes de la logique"Metamathematics (1,666 words) [view diff] exact match in snippet view article find links to article
Pigozzi, "Alfred Tarski's Work on General Metamathematics", The Journal of Symbolic Logic, v. 53, No. 1 (Mar., 1988), pp. 36–50. I. J. Good. "A Note onLinear extension (1,488 words) [view diff] exact match in snippet view article find links to article
Prime Ideal Theorem from the Order-Extension Principle", The Journal of Symbolic Logic, 64 (1): 199–215, CiteSeerX 10.1.1.54.8336, doi:10.2307/2586759Matthew Hennessy (358 words) [view diff] exact match in snippet view article find links to article
"Reviewed Work: Algebraic Theory of Processes by Matthew Hennessy". Journal of Symbolic Logic. 55 (1): 366–368. doi:10.2307/2275000. JSTOR 2275000. S2CID 117105841Jean Gallier (473 words) [view diff] exact match in snippet view article find links to article
Computer Science. Foundations of Automatic Theorem Proving" (PDF), Journal of Symbolic Logic, 54 (1): 288–289, doi:10.2307/2275035, JSTOR 2275035, S2CID 117298919Anita Burdman Feferman (904 words) [view diff] exact match in snippet view article find links to article
untitled periodical (link) Enderton, H. B. (December 1993), The Journal of Symbolic Logic, 58 (4): 1465–1466, doi:10.2307/2275157, JSTOR 2275157{{citation}}:W. D. Hart (192 words) [view diff] exact match in snippet view article find links to article
(September 1998). "Review: W. D. Hart, The Philosophy of Mathematics". Journal of Symbolic Logic. 63 (3): 1180–1183. doi:10.2307/2586733. ISSN 0022-4812. JSTOR 2586733Laurence R. Horn (414 words) [view diff] exact match in snippet view article find links to article
(1991). "Review: Laurence R. Horn, A Natural History of Negation". Journal of Symbolic Logic. 56 (3): 1103–1104. doi:10.2178/jsl/1183743767. Xie, Chaoqun (2003)Modal logic (8,452 words) [view diff] exact match in snippet view article find links to article
Functional Calculus of First Order Based on Strict Implication". Journal of Symbolic Logic. 11 (1): 1–16. doi:10.2307/2269159. JSTOR 2269159. S2CID 250349611Determinacy (4,120 words) [view diff] exact match in snippet view article find links to article
D. A. (December 1998). "The determinacy of Blackwell games". Journal of Symbolic Logic. 63 (4): 1565–1581. doi:10.2307/2586667. JSTOR 2586667. S2CID 42107522Low (computability) (376 words) [view diff] exact match in snippet view article
Theoretic Definitions of the Low2 Recursively Enumerable sets. The Journal of Symbolic Logic Vol. 60, No. 3 (Sep., 1995), p. 728 C. J. Ash, J. Knight, ComputableWeakly compact cardinal (918 words) [view diff] exact match in snippet view article find links to article
(1991), "Indescribable Cardinals and Elementary Embeddings", Journal of Symbolic Logic, 56 (2), Association for Symbolic Logic: 439–457, doi:10.2307/2274692Craig interpolation (1,059 words) [view diff] exact match in snippet view article find links to article
Craig, Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory, The Journal of Symbolic Logic 22 (1957), no. 3, 269–285.Stephen Cook (1,510 words) [view diff] exact match in snippet view article find links to article
"The Relative Efficiency of Propositional Proof Systems". The Journal of Symbolic Logic. 44 (1): 36–50. doi:10.2307/2273702. ISSN 0022-4812. JSTOR 2273702Antiphilosophy (812 words) [view diff] exact match in snippet view article find links to article
against CH Penelope Maddy, June 1988, "Believing the Axioms, I", Journal of Symbolic Logic 53 (2): 481–511, pdf Pigliucci, Massimo (2018-01-25). "The ProblemBimal Krishna Matilal (935 words) [view diff] exact match in snippet view article find links to article
Indian Philosophical Analysis by Bimal Krishna Matilal". The Journal of Symbolic Logic. 40 (4): 578–579. doi:10.2307/2271783. JSTOR 2271783. S2CID 117338922Axiom of constructibility (1,064 words) [view diff] exact match in snippet view article find links to article
- from P. Maddy (1988), "Believing the Axioms. I" (PDF), The Journal of Symbolic Logic, 53, p. 506 W. Marek, Observations Concerning Elementary ExtensionsMaría Manzano (266 words) [view diff] exact match in snippet view article find links to article
maint: untitled periodical (link) Venema, Yde (September 1998), Journal of Symbolic Logic, 63 (3): 1194–1196, doi:10.2307/2586742, JSTOR 2586742,Word problem (mathematics) (3,202 words) [view diff] exact match in snippet view article
1947). "Recursive Unsolvability of a problem of Thue" (PDF). Journal of Symbolic Logic. 12 (1): 1–11. doi:10.2307/2267170. JSTOR 2267170. S2CID 30320278Propositional proof system (1,121 words) [view diff] exact match in snippet view article find links to article
(1979). "The Relative Efficiency of Propositional Proof Systems". Journal of Symbolic Logic. Vol. 44, no. 1. pp. 36–50. JSTOR 2273702. Samuel Buss (1998)Menger space (624 words) [view diff] exact match in snippet view article find links to article
Forcing and Combinatorial Covering Properties of Filters". The Journal of Symbolic Logic. 80 (4): 1398–1410. arXiv:1401.2283. doi:10.1017/jsl.2014.73.Choice sequence (1,097 words) [view diff] exact match in snippet view article find links to article
free choice sequences and the topological completeness proofs". Journal of Symbolic Logic. 23 (4): 369–388. doi:10.2307/2964012. JSTOR 2964012. LinneboConcatenation theory (291 words) [view diff] exact match in snippet view article find links to article
Corcoran, William Frank and Michael Maloney, "String theory", Journal of Symbolic Logic, vol. 39 (1974) pp. 625– 637 Pages 173–4 of Alfred Tarski, TheKleene's O (2,310 words) [view diff] exact match in snippet view article find links to article
Kleene, S. C. (1938), "On Notation for Ordinal Numbers", The Journal of Symbolic Logic, 3 (4), Association for Symbolic Logic: 150–155, doi:10.2307/2267778Reflection principle (3,584 words) [view diff] exact match in snippet view article find links to article
ISBN 978-0262529167. P. Maddy, "Believing the Axioms. I", pp.501--503. Journal of Symbolic Logic vol. 53, no. 2 (1988). Barton, Neil; Caicedo, Andrés Eduardo;K-trivial set (1,837 words) [view diff] exact match in snippet view article find links to article
Terwijn (1999), "Lowness for the Class of Random Sets", The Journal of Symbolic Logic Vol. 64, No. 4 (Dec., 1999), pp. 1396–1402 Rod G. Downey, DenisJames Earl Baumgartner (471 words) [view diff] exact match in snippet view article find links to article
Harrington, Leo; Kleinberg, Eugene, Adding a closed unbounded set, Journal of Symbolic Logic, 41(2):481–482, 1976 Baumgartner, James E., Ineffability propertiesPeano axioms (6,428 words) [view diff] exact match in snippet view article find links to article
Wang, Hao (June 1957). "The Axiomatization of Arithmetic". The Journal of Symbolic Logic. 22 (2). Association for Symbolic Logic: 145–158. doi:10.2307/2964176Romane Clark (176 words) [view diff] exact match in snippet view article find links to article
negation. Philosophical Studies, vol. 4 (1953), pp. 81–87". The Journal of Symbolic Logic. 20 (1): 59–60. doi:10.2307/2268056. ISSN 0022-4812. JSTOR 2268056Augustin Sesmat (285 words) [view diff] exact match in snippet view article find links to article
industrielles 1130. Hermann & Cie, Paris1951, pp. 361–776". The Journal of Symbolic Logic. 25 (1): 77. doi:10.2307/2964357. ISSN 0022-4812. JSTOR 2964357Many-sorted logic (1,225 words) [view diff] exact match in snippet view article find links to article
logic include: Wang, Hao (1952). "Logic of many-sorted theories". Journal of Symbolic Logic. 17 (2): 105–116. doi:10.2307/2266241. JSTOR 2266241., collectedSolovay model (1,124 words) [view diff] exact match in snippet view article find links to article
You Take Solovay's Inaccessible Away? by Saharon Shelah"", The Journal of Symbolic Logic, 54 (2), Association for Symbolic Logic: 633–635, doi:10.2307/2274892Generic-case complexity (2,706 words) [view diff] exact match in snippet view article find links to article
Miasnikov and A. Rybalov, Generic complexity of undecidable problems, Journal of Symbolic Logic 73 (2008), 656–673. A. Rybalov, On the strongly generic undecidabilityHistory of the Church–Turing thesis (8,298 words) [view diff] exact match in snippet view article find links to article
first two by A. M. Turing, Computability and λ-definability [Journal of Symbolic Logic, vol. 2 (1937), pp. 153-163]." Kleene defines "general recursive"Weakly o-minimal structure (508 words) [view diff] case mismatch in snippet view article find links to article
Elimination of Quantifiers for Ordered Valuation Rings, The Journal of symbolic Logic, Vol. 52, No. 1 (Mar., 1987), pp 116-128. D. Macpherson, D. MarkerReverse mathematics (4,767 words) [view diff] exact match in snippet view article find links to article
B.; Lempp, S.; Slaman, T.A. (2004), "Comparing DNR and WWKL", Journal of Symbolic Logic, 69 (4): 1089, arXiv:1408.2281, doi:10.2178/jsl/1102022212, S2CID 17582399Compactness theorem (1,947 words) [view diff] exact match in snippet view article find links to article
JSTOR 2274031 Vaught, Robert L.: "Alfred Tarski's work in model theory". Journal of Symbolic Logic 51 (1986), no. 4, 869–882 Robinson, A.: Non-standard analysisRay Turner (computer scientist) (338 words) [view diff] exact match in snippet view article
Springer, 2018, ISBN 978-3-662-55565-1 A theory of properties, The Journal of Symbolic Logic. 52 (02), 455–472. Counterfactuals without possible worlds, JournalRay Turner (computer scientist) (338 words) [view diff] exact match in snippet view article
Springer, 2018, ISBN 978-3-662-55565-1 A theory of properties, The Journal of Symbolic Logic. 52 (02), 455–472. Counterfactuals without possible worlds, JournalAndrás Hajnal (1,913 words) [view diff] exact match in snippet view article find links to article
; Hajnal, Andras (2001), "Polarized partition relations", The Journal of Symbolic Logic, 66 (2), Association for Symbolic Logic: 811–821, doi:10.2307/2695046Rolando Chuaqui (424 words) [view diff] exact match in snippet view article find links to article
Rolando (March 1986). "Pragmatic truth and approximation to truth". Journal of Symbolic Logic. 51 (1): 201–221. doi:10.2307/2273956. "Rolando Chuaqui Kettlun"Measurable cardinal (1,774 words) [view diff] exact match in snippet view article find links to article
ISBN 3-540-00384-3. Maddy, Penelope (1988), "Believing the Axioms. II", The Journal of Symbolic Logic, 53 (3): 736–764, doi:10.2307/2274569, JSTOR 2274569, S2CID 16544090Paraconsistent logic (6,358 words) [view diff] exact match in snippet view article find links to article
Feferman, Solomon (1984). "Toward Useful Type-Free Theories, I". The Journal of Symbolic Logic. 49 (1): 75–111. doi:10.2307/2274093. JSTOR 2274093. S2CID 10575304Fuzzy logic (6,618 words) [view diff] exact match in snippet view article find links to article
Giangiacomo (March 2006). "Effectiveness and multivalued logics". Journal of Symbolic Logic. 71 (1): 137–162. doi:10.2178/jsl/1140641166. S2CID 12322009.David Turner (computer scientist) (845 words) [view diff] exact match in snippet view article
S2CID 40541269. Another Algorithm for Bracket Abstraction, D. A. Turner, Journal of Symbolic Logic, 44(2):267–270, 1979. Functional Programming and its ApplicationsRichardson's theorem (701 words) [view diff] exact match in snippet view article find links to article
Problems Involving Elementary Functions of a Real Variable". Journal of Symbolic Logic. 33 (4): 514–520. doi:10.2307/2271358. JSTOR 2271358. Zbl 0175Lambda calculus (11,577 words) [view diff] exact match in snippet view article find links to article
Alan M. (December 1937). "Computability and λ-Definability". The Journal of Symbolic Logic. 2 (4): 153–163. doi:10.2307/2268280. JSTOR 2268280. S2CID 2317046Subtle cardinal (569 words) [view diff] exact match in snippet view article find links to article
(2002). Accessed 18 April 2024. C. Henrion, "Properties of Subtle Cardinals. Journal of Symbolic Logic, vol. 52, no. 4 (1987), pp.1005--1019." v t eSpecker sequence (697 words) [view diff] exact match in snippet view article find links to article
second-order arithmetic, Springer. E. Specker (1949), "Nicht konstruktiv beweisbare Sätze der Analysis" Journal of Symbolic Logic, v. 14, pp. 145–158.Hilbert's second problem (1,500 words) [view diff] exact match in snippet view article find links to article
Stephen G. (1988). "Partial realizations of Hilbert's Program". Journal of Symbolic Logic. 53 (2): 349–363. CiteSeerX 10.1.1.79.5808. doi:10.2307/2274508Jónsson cardinal (423 words) [view diff] exact match in snippet view article find links to article
J.: "Jonsson Cardinals, Erdos Cardinals and the Core Model", Journal of Symbolic Logic 64(3):1065-1086, 1999. Kanamori, Akihiro (2003). The Higher Infinite:Semantic Analysis (book) (138 words) [view diff] exact match in snippet view article
Press Paul Benacerraf, "Review: Paul Ziff, Semantic Analysis", Journal of Symbolic Logic, Volume 29, Issue 4 (1964), 193–194. review at projecteuclid.orgJohn Mueller Anderson (251 words) [view diff] exact match in snippet view article find links to article
Company, Inc., Belmont, California, 1962, xii + 418 pp". The Journal of Symbolic Logic. 29 (2): 93–94. doi:10.2307/2270418. ISSN 0022-4812. JSTOR 2270418Tame abstract elementary class (1,041 words) [view diff] exact match in snippet view article find links to article
Shelah, Saharon (2008), "Examples of non-locality" (PDF), The Journal of Symbolic Logic, 73 (3): 765–782, doi:10.2178/jsl/1230396746, S2CID 7276664 ShelahLiu Lu (226 words) [view diff] exact match in snippet view article find links to article
Retrieved 2012-03-24. Liu, Lu (2012), "RT22 does not imply WKL0", The Journal of Symbolic Logic, 77 (2): 609–620, arXiv:1602.03784, doi:10.2178/jsl/1333566640Zero sharp (1,677 words) [view diff] exact match in snippet view article find links to article
ISBN 0-444-10535-2. Harrington, Leo (1978). "Analytic determinacy and 0 #". Journal of Symbolic Logic. 43 (4): 685–693. doi:10.2307/2273508. ISSN 0022-4812. JSTOR 2273508Core model (1,080 words) [view diff] exact match in snippet view article find links to article
2010, ISBN 978-1402048432. Ronald Jensen and John R. Steel. "K without the measurable". Journal of Symbolic Logic Volume 78, Issue 3 (2013), 708-734.Induction-induction (483 words) [view diff] exact match in snippet view article find links to article
simultaneous inductive-recursive definitions in type theory" (PDF). Journal of Symbolic Logic. 65 (2): 525–549. CiteSeerX 10.1.1.6.4575. doi:10.2307/2586554Michael Hallett (149 words) [view diff] exact match in snippet view article find links to article
University Press, Oxford and New York1984, xxiii + 343 pp". The Journal of Symbolic Logic. 52 (2): 568–570. doi:10.2307/2274416. ISSN 0022-4812. DaubenWarner Wick (108 words) [view diff] exact match in snippet view article find links to article
University of Chicago Press, Chicago1942, xiii + 202 pp". The Journal of Symbolic Logic. 8 (1): 29–30. doi:10.2307/2267981. ISSN 0022-4812. "Warner Wick"Bar induction (988 words) [view diff] exact match in snippet view article find links to article
Rathjen, The role of parameters in bar rule and bar induction, Journal of Symbolic Logic 56 (1991), no. 2, pp. 715–730. A. S. Troelstra, Choice sequencesHorn-satisfiability (1,073 words) [view diff] exact match in snippet view article find links to article
"On sentences which are true of direct unions of algebras". Journal of Symbolic Logic. 16 (1): 14–21. doi:10.2307/2268661. Stephen Cook; Phuong NguyenFunctional programming (8,688 words) [view diff] exact match in snippet view article find links to article
Turing, A. M. (1937). "Computability and λ-definability". The Journal of Symbolic Logic. 2 (4). Cambridge University Press: 153–163. doi:10.2307/2268280Iterated forcing (424 words) [view diff] exact match in snippet view article find links to article
Schlindwein, Chaz, Shelah's work on non-semiproper iterations II, Journal of Symbolic Logic (66) 2001, pp. 1865–1883 Jech, Thomas (2003), Set Theory: MillenniumMyhill isomorphism theorem (1,122 words) [view diff] exact match in snippet view article find links to article
Grundlagen der Mathetmatik, vol. 1 (1955), pp. 310–317". The Journal of Symbolic Logic. 22 (3): 310–317. doi:10.2307/2963619. ISSN 0022-4812. JSTOR 2963619Friedrich Bachmann (788 words) [view diff] exact match in snippet view article find links to article
Gottlob Frege" [The Scientific Estate of Gottlob Frege]. The Journal of Symbolic Logic. 2 (1): 56. doi:10.2307/2268843. JSTOR 2268843. Bachmann, FriedrichLévy hierarchy (1,393 words) [view diff] exact match in snippet view article find links to article
Hauser, "Indescribable cardinals and elementary embeddings". Journal of Symbolic Logic vol. 56, iss. 2 (1991), pp.439--457. W. Pohlers, Proof Theory:Joyce Friedman (598 words) [view diff] exact match in snippet view article find links to article
Andrews, Peter (1968), "On simplifying the matrix of a wff", The Journal of Symbolic Logic, 33 (2): 180–192, doi:10.2307/2269865, JSTOR 2269865, MR 0255371Rohit Jivanlal Parikh (1,092 words) [view diff] exact match in snippet view article find links to article
Fundamental Research Bombay Existence and Feasibility in Arithmetic, Journal of Symbolic Logic 36 (1971) pages 494–508. On the Length of Proofs, TransactionsErdős cardinal (767 words) [view diff] exact match in snippet view article find links to article
Cardinals, Erdős Cardinals, and the Generic Vopěnka Principle". The Journal of Symbolic Logic. 84 (4): 1711–1721. arXiv:1807.02207. doi:10.1017/jsl.2018.76Inaccessible cardinal (2,247 words) [view diff] exact match in snippet view article find links to article
Hauser, "Indescribable cardinals and elementary embeddings". Journal of Symbolic Logic vol. 56, iss. 2 (1991), pp.439--457. K. J. Devlin, "IndescribabilityEnumeration reducibility (1,437 words) [view diff] exact match in snippet view article find links to article
und Grundlagen der Mathematik, vol. 5 (1959), pp. 117–125". The Journal of Symbolic Logic. 25 (4): 362–363. doi:10.2307/2963569. ISSN 0022-4812. JSTOR 2963569Mathematical psychology (3,095 words) [view diff] exact match in snippet view article find links to article
1958). "Foundational aspects of theories of measurement1". The Journal of Symbolic Logic. 23 (2): 113–128. doi:10.2307/2964389. ISSN 0022-4812. JSTOR 2964389Willard Van Orman Quine (6,503 words) [view diff] exact match in snippet view article find links to article
and W. V. O. Quine, "Steps Toward a Constructive Nominalism", Journal of Symbolic Logic, 12 (1947): 105–122. Armstrong, D. M. (2010). Sketch for a systematicVirgil Aldrich (710 words) [view diff] exact match in snippet view article find links to article
Library, University of Utah Body, Mind and Method available at Google Books Entry for Virgil Aldrich at JSTOR Review at the Journal of Symbolic LogicMereology (7,356 words) [view diff] exact match in snippet view article find links to article
Quine, Willard, 1947, "Steps toward a constructive nominalism", Journal of Symbolic Logic 12: 97–122. Gruszczynski, R., and Pietruszczak, A., 2008, "FullJiří Rosický (mathematician) (387 words) [view diff] exact match in snippet view article
Andrew (2013). "On Colimits and Elementary Embeddings". The Journal of Symbolic Logic. 78 (2): 562–578. arXiv:1202.5215. doi:10.2178/jsl.7802120. ISSN 0022-4812Axiom of non-choice (698 words) [view diff] exact match in snippet view article find links to article
function concept Myhill, John (1975). "Constructive Set Theory". The Journal of Symbolic Logic. 40 (3): 347–382. doi:10.2307/2272159. JSTOR 2272159. MichaelModel theory (9,038 words) [view diff] exact match in snippet view article find links to article
Wilfrid (1988). "Alfred Tarski and Decidable Theories". The Journal of Symbolic Logic. 53 (1): 20. doi:10.2307/2274425. ISSN 0022-4812. JSTOR 2274425Semiorder (2,281 words) [view diff] exact match in snippet view article find links to article
(1958), "Foundational aspects of theories of measurement", The Journal of Symbolic Logic, 23 (2): 113–128, doi:10.2307/2964389, JSTOR 2964389, MR 0115919Jin Yuelin (2,008 words) [view diff] exact match in snippet view article find links to article
Third edition, The Commercial Press, Shanghai1948, 362 pp". Journal of Symbolic Logic. 14 (2): 125–126. doi:10.2307/2266513. JSTOR 2266513. SchwarczGödel's speed-up theorem (540 words) [view diff] exact match in snippet view article find links to article
proofs. I. Number of lines and speedup for arithmetics", The Journal of Symbolic Logic, 59 (3): 737–756, doi:10.2307/2275906, ISSN 0022-4812, JSTOR 2275906Induction-recursion (1,134 words) [view diff] exact match in snippet view article find links to article
simultaneous inductive-recursive definitions in type theory" (PDF). Journal of Symbolic Logic. 65 (2): 525–549. CiteSeerX 10.1.1.6.4575. doi:10.2307/2586554Q0 (mathematical logic) (1,135 words) [view diff] exact match in snippet view article
(1940). "A Formulation of the Simple Theory of Types" (PDF). Journal of Symbolic Logic. 5 (2): 56–58. doi:10.2307/2266170. JSTOR 2266170. S2CID 15889861Nielsen–Schreier theorem (1,691 words) [view diff] exact match in snippet view article find links to article
(1985), "Subgroups of a free group and the axiom of choice", The Journal of Symbolic Logic, 50 (2): 458–467, doi:10.2307/2274234, JSTOR 2274234, MR 0793126Turing machine (9,420 words) [view diff] exact match in snippet view article find links to article
Emil Post (1936), "Finite Combinatory Processes—Formulation 1", Journal of Symbolic Logic, 1, 103–105, 1936. Reprinted in The Undecidable, pp. 289ff. EmilIntersection type discipline (2,302 words) [view diff] exact match in snippet view article find links to article
filter lambda model and the completeness of type assignment". Journal of Symbolic Logic. 48 (4): 931–940. doi:10.2307/2273659. JSTOR 2273659. S2CID 45660117Hurewicz space (1,025 words) [view diff] exact match in snippet view article find links to article
Forcing and Combinatorial Covering Properties of Filters". The Journal of Symbolic Logic. 80 (4): 1398–1410. arXiv:1401.2283. doi:10.1017/jsl.2014.73.Ruy de Queiroz (1,250 words) [view diff] exact match in snippet view article find links to article
interpretation to linear, relevant and other resource logics, in Journal of Symbolic Logic 57(4):1319-1365. Paper presented at Logic Colloquium '90, HelsinkiComputable number (3,269 words) [view diff] exact match in snippet view article find links to article
(1949). "Nicht konstruktiv beweisbare Sätze der Analysis" (PDF). Journal of Symbolic Logic. 14 (3): 145–158. doi:10.2307/2267043. JSTOR 2267043. S2CID 11382421Computational theory of mind (2,835 words) [view diff] exact match in snippet view article find links to article
Hook, New York University Press, New York 1960, pp. 148–179.)". Journal of Symbolic Logic. 36 (1): 177. doi:10.2307/2271581. ISSN 0022-4812. JSTOR 2271581Finite model theory (3,116 words) [view diff] exact match in snippet view article find links to article
Fagin, Ronald (1976). "Probabilities on Finite Models". The Journal of Symbolic Logic. 41 (1): 50–58. doi:10.2307/2272945. JSTOR 2272945. Glebskiĭ,Non-well-founded set theory (1,481 words) [view diff] exact match in snippet view article find links to article
Karel (1992), "Standard foundations for nonstandard analysis", Journal of Symbolic Logic, 57 (2): 741–748, doi:10.2307/2275304, JSTOR 2275304, S2CID 39158351Tarski's axioms (3,747 words) [view diff] exact match in snippet view article find links to article
Springer-Verlag. Szczerba, L. W. (1986). "Tarski and Geometry" (PDF). Journal of Symbolic Logic. 51 (4): 907–12. doi:10.2307/2273904. JSTOR 2273904. S2CID 35275962Ackermann set theory (1,332 words) [view diff] exact match in snippet view article find links to article
2022. Lévy, Azriel (June 1959). "On Ackermann's Set Theory". The Journal of Symbolic Logic. 24 (2): 154–166. doi:10.2307/2964757. JSTOR 2964757. S2CID 31382168Code (set theory) (425 words) [view diff] exact match in snippet view article
Mitchell, William J. (1998), "The complexity of the core model", The Journal of Symbolic Logic, 63 (4): 1393–1398, arXiv:math/9210202, doi:10.2307/2586656, JSTOR 2586656John L. Pollock (1,511 words) [view diff] exact match in snippet view article find links to article
world," The Philosophical Review, 1967. "Basic modal logic," Journal of Symbolic Logic, 1967. "What Is an Epistemological Problem? American PhilosophicalAxiom of limitation of size (6,684 words) [view diff] exact match in snippet view article find links to article
Paul (1937), "A System of Axiomatic Set Theory—Part I", The Journal of Symbolic Logic, 2 (1): 65–77, doi:10.2307/2268862, JSTOR 2268862. Bernays, PaulPeter Glassen (1,028 words) [view diff] exact match in snippet view article find links to article
and properties. This paper was reviewed by Alonzo Church in The Journal of Symbolic Logic 32:3 (Sept. 1968), p. 408. A Fallacy in Aristotle's Argument aboutVáclav E. Beneš (1,179 words) [view diff] exact match in snippet view article find links to article
(review). A Partial Model for Quine's "New Foundations", The Journal of Symbolic Logic, Vol. 19, No. 3, pp. 197–200, September 1954 On the ConsistencySmn theorem (1,213 words) [view diff] exact match in snippet view article find links to article
S. C. (1938). "On Notations for Ordinal Numbers" (PDF). The Journal of Symbolic Logic. 3 (4): 150–155. doi:10.2307/2267778. JSTOR 2267778. S2CID 34314018Axiom (4,918 words) [view diff] exact match in snippet view article find links to article
example Maddy, Penelope (June 1988). "Believing the Axioms, I". Journal of Symbolic Logic. 53 (2): 481–511. doi:10.2307/2274520. JSTOR 2274520. for a realistLiar paradox (4,443 words) [view diff] exact match in snippet view article find links to article
Shepherdson, J. (Mar 2000). "The Liar Paradox and Fuzzy Logic". The Journal of Symbolic Logic. 61 (1): 339–346. doi:10.2307/2586541. JSTOR 2586541. S2CID 6865763Scott–Potter set theory (1,846 words) [view diff] exact match in snippet view article find links to article
Society: 207–14. Review of Potter(1990): McGee, Vann, "[1]" "Journal of Symbolic Logic 1993":1077-1078 Reviews of Potter (2004): Bays, Timothy, 2005Eva Kallin (621 words) [view diff] exact match in snippet view article find links to article
MR 0106185. Szczerba, L. W. (1986), "Tarski and geometry", The Journal of Symbolic Logic, 51 (4): 907–912, doi:10.2307/2273904, JSTOR 2273904, MR 0865918Hilary Putnam (8,908 words) [view diff] exact match in snippet view article find links to article
unsolvability of constructible sets of integers". Journal of Symbolic Logic. 33 (4). The Journal of Symbolic Logic: 497–513. doi:10.2307/2271357. JSTOR 2271357Criticism of nonstandard analysis (3,520 words) [view diff] exact match in snippet view article find links to article
Saharon (2004). "A definable nonstandard model of the reals". Journal of Symbolic Logic. 69 (1): 159–164. arXiv:math/0311165. doi:10.2178/jsl/1080938834Schism in Christianity (1,880 words) [view diff] exact match in snippet view article find links to article
la France et de l'Etranger, vol. 153 (1963), pp. 293–301". The Journal of Symbolic Logic. 40 (4): 599–600. doi:10.2307/2271807. ISSN 0022-4812. JSTOR 2271807Gentzen's consistency proof (1,993 words) [view diff] exact match in snippet view article find links to article
June 1985). "Cuts, Consistency Statements and Interpretations". Journal of Symbolic Logic. 50 (2): 423–441. doi:10.2307/2274231. ISSN 0022-4812. JSTOR 2274231Intersection type (2,394 words) [view diff] exact match in snippet view article find links to article
filter lambda model and the completeness of type assignment". Journal of Symbolic Logic. 48 (4): 931–940. doi:10.2307/2273659. JSTOR 2273659. S2CID 45660117Algorithmic information theory (2,582 words) [view diff] exact match in snippet view article find links to article
Van Lambagen (1989). "Algorithmic Information Theory" (PDF). Journal of Symbolic Logic. 54 (4): 1389–1400. doi:10.1017/S0022481200041153. S2CID 250348327Benjamin Abram Bernstein (1,213 words) [view diff] exact match in snippet view article find links to article
1937). "Remarks on Nicod's reduction of Principia Mathematica". Journal of Symbolic Logic. 2 (4): 165–166. doi:10.2307/2268282. JSTOR 2268282. S2CID 21038928Naive set theory (4,715 words) [view diff] exact match in snippet view article find links to article
Kalmar (Laszlo Kalmar (1946). "The Paradox of Kleene and Rosser". Journal of Symbolic Logic. 11 (4): 136.). The term was later popularized in a book by PaulThomas B. Steel (433 words) [view diff] exact match in snippet view article find links to article
Bibliography of the theory of questions and answers. Therein, pp. 155–200". The Journal of Symbolic Logic. 43 (2): 379–380. doi:10.2307/2272838. JSTOR 2272838.Second-order logic (4,387 words) [view diff] exact match in snippet view article find links to article
xi. Henkin, L. (1950). "Completeness in the theory of types". Journal of Symbolic Logic. 15 (2): 81–91. doi:10.2307/2266967. JSTOR 2266967. S2CID 36309665Formula for primes (3,872 words) [view diff] exact match in snippet view article find links to article
Jones, James P. (1982), "Universal diophantine equation", Journal of Symbolic Logic, 47 (3): 549–571, doi:10.2307/2273588, JSTOR 2273588, S2CID 11148823Richard Milton Martin (1,865 words) [view diff] exact match in snippet view article find links to article
Martin, R. M. (1943). "A Homogeneous System for Formal Logic". The Journal of Symbolic Logic. 8 (1): 1–23. doi:10.2307/2267976. ISSN 0022-4812. JSTOR 2267976Alice Mary Hilton (1,311 words) [view diff] exact match in snippet view article find links to article
C., and Cleaver-Hume Press, London, 1963, xxi + 427 pp". The Journal of Symbolic Logic. 38 (2): 341–342. doi:10.2307/2272108. ISSN 0022-4812. JSTOR 2272108Veblen function (2,756 words) [view diff] exact match in snippet view article find links to article
(1976), "Normal Functions and Constructive Ordinal Notations", The Journal of Symbolic Logic, 41 (2): 439–459, doi:10.2307/2272243, JSTOR 2272243 MassmannLaw of noncontradiction (3,178 words) [view diff] exact match in snippet view article find links to article
Shepherdson, John (2000). "The Liar Paradox and Fuzzy Logic". The Journal of Symbolic Logic. 65 (1): 339–346. doi:10.2307/2586541. ISSN 0022-4812. JSTOR 2586541Matthias Schirn (1,165 words) [view diff] exact match in snippet view article find links to article
Review, Synthese, Erkenntnis, Axiomathes, Acta Analytica, The Journal of Symbolic Logic,The Review of Symbolic Logic, Notre Dame Journal of Formal LogicErdős–Dushnik–Miller theorem (677 words) [view diff] exact match in snippet view article find links to article
consistent extensions of the Erdős–Dushnik–Miller theorem", The Journal of Symbolic Logic, 65 (1): 259–271, arXiv:math/9709228, doi:10.2307/2586535, JSTOR 2586535Simon Thompson (professor) (624 words) [view diff] exact match in snippet view article
"Axiomatic Recursion Theory and the Continuous Functionals". Journal of Symbolic Logic. 50 (2). New York, New York: 442–450. doi:10.2307/2274232. JSTOR 2274232Existential graph (2,957 words) [view diff] exact match in snippet view article find links to article
University of Chicago. (1967), "A System of Implicit Quantification," Journal of Symbolic Logic 32: 480–504. Stanford Encyclopedia of Philosophy: Peirce's LogicData-driven model (806 words) [view diff] exact match in snippet view article find links to article
orderings. Information sciences, vol. 3 (1971), pp. 177–200.. Journal of Symbolic Logic, 38(4):656-657. doi:10.2307/2272014 Simon, Haykin. (2009). NeuralProblem of universals (4,939 words) [view diff] exact match in snippet view article find links to article
January 2011. Quine, W. V. (September 1947). "On Universals". The Journal of Symbolic Logic. 12 (3): 74–84. doi:10.2307/2267212. JSTOR 2267212. S2CID 23766882Constraint satisfaction problem (3,353 words) [view diff] exact match in snippet view article find links to article
Pongrácz, András (March 2021). "Projective Clone Homomorphisms". The Journal of Symbolic Logic. 86 (1): 148–161. arXiv:1409.4601. doi:10.1017/jsl.2019.23. ISSN 0022-4812William of Ockham (4,928 words) [view diff] exact match in snippet view article find links to article
S2CID 170450442. John Corcoran (1981). "Ockham's Syllogistic Semantics", Journal of Symbolic Logic, 46: 197–198. "William of Ockham: Defending the Church, CondemningHistory of type theory (2,822 words) [view diff] exact match in snippet view article find links to article
pbk). A. Church, A formulation of the simple theory of types, Journal of Symbolic Logic 5 (1940) 56–68. J. Collins, A History of the Theory of Types:Hyperreal number (4,918 words) [view diff] exact match in snippet view article find links to article
Saharon (2004), "A definable nonstandard model of the reals" (PDF), Journal of Symbolic Logic, 69: 159–164, arXiv:math/0311165, doi:10.2178/jsl/1080938834,Knuth's up-arrow notation (3,400 words) [view diff] exact match in snippet view article find links to article
(Dec 1947). "Transfinite Ordinals in Recursive Number Theory". Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943Variadic function (3,276 words) [view diff] exact match in snippet view article find links to article
Symbolic Logic, held in Cambridge MA on December 28–30, 1936, [1], Journal of Symbolic Logic 2(1) 1937, 63. Klemens, Ben (2014). 21st Century C: C Tips fromGeorge Bealer (452 words) [view diff] exact match in snippet view article find links to article
Completeness in the theory of properties, relations, and propositions. Journal of Symbolic Logic 48 (2):415-426. Bealer, George (1987). The philosophical limitsCharacteristica universalis (4,792 words) [view diff] exact match in snippet view article find links to article
of On the Project of a Universal Character by Jonathan Cohen," Journal of Symbolic Logic 19: 133. Rogers, Jr., Hartley, 1963. "An Example in MathematicalInternal–external distinction (2,728 words) [view diff] exact match in snippet view article find links to article
(1955). "Review: W. V. Quine, On Carnap's Views on Ontology". The Journal of Symbolic Logic. 20 (1): 61–62. doi:10.2307/2268063. JSTOR 2268063. Quoted byStructural Ramsey theory (2,383 words) [view diff] exact match in snippet view article find links to article
Leo A. (September 1978). "Models Without Indiscernibles". The Journal of Symbolic Logic. 43 (3): 572. doi:10.2307/2273534. ISSN 0022-4812. JSTOR 2273534Skolem's paradox (3,279 words) [view diff] exact match in snippet view article find links to article
JSTOR 20114910. Putnam, Hilary (Sep 1980). "Models and Reality" (PDF). The Journal of Symbolic Logic. 45 (3): 464–482. doi:10.2307/2273415. JSTOR 2273415. S2CID 18831300Noam Chomsky bibliography and filmography (4,263 words) [view diff] exact match in snippet view article find links to article
Pennsylvania. — (Sep 1953). "Systems of Syntactic Analysis" (PDF). The Journal of Symbolic Logic. 18 (3): 242–256. doi:10.2307/2267409. JSTOR 2267409. S2CID 11796020Nyaya (7,316 words) [view diff] exact match in snippet view article find links to article
the Encyclopaedia Britannica, XIV Edition, Chicago 1959". The Journal of Symbolic Logic. 23 (1): 22–29. doi:10.2307/2964454. ISSN 0022-4812. JSTOR 2964454Alan R. White (6,107 words) [view diff] exact match in snippet view article find links to article
JSTOR 2218870. Hanson, William H. (1977). "Review of Modal Thinking". The Journal of Symbolic Logic. 42 (3): 428–430. doi:10.2307/2272877. ISSN 0022-4812. JSTOR 2272877Register allocation (5,066 words) [view diff] exact match in snippet view article find links to article
W., Plenum Press, New York and London 1972, pp. 85–103". The Journal of Symbolic Logic. 40 (4): 618–619. doi:10.2307/2271828. ISSN 0022-4812. JSTOR 2271828Type theory (7,919 words) [view diff] exact match in snippet view article find links to article
Alonzo (1940). "A formulation of the simple theory of types". The Journal of Symbolic Logic. 5 (2): 56–68. doi:10.2307/2266170. JSTOR 2266170. S2CID 15889861List of unsolved problems in mathematics (19,668 words) [view diff] exact match in snippet view article find links to article
Hrushovski, Ehud (1989). "Kueker's conjecture for stable theories". Journal of Symbolic Logic. 54 (1): 207–220. doi:10.2307/2275025. JSTOR 2275025. S2CID 41940041Selman's theorem (1,197 words) [view diff] exact match in snippet view article find links to article
(2004). "Degrees of Unsolvability of Continuous Functions" (PDF). Journal of Symbolic Logic. 69 (2): 555–584. doi:10.2178/jsl/1082418543. Retrieved 2024-06-03Sun-Joo Shin (597 words) [view diff] exact match in snippet view article find links to article
"Review", Modern Logic, 6 (3): 322–330 Hammer, Eric M. (March 1996), Journal of Symbolic Logic, 61 (1): 341–342, doi:10.2307/2275618, JSTOR 2275618{{citation}}:Maria Carla Galavotti (651 words) [view diff] exact match in snippet view article find links to article
doi:10.1093/bjps/48.2.300, JSTOR 687755 Mathieu Marion, The Journal of Symbolic Logic, doi:10.2307/2586732, JSTOR 2586732 E. Mendelson, MR1204886, Zbl 1092Jeffrey B. Remmel (568 words) [view diff] exact match in snippet view article find links to article
"Major Subspaces of Recursively Enumerable Vector Spaces". The Journal of Symbolic Logic. 43 (2): 293–303. doi:10.2307/2272828. ISSN 0022-4812. JSTOR 2272828Stable theory (3,633 words) [view diff] exact match in snippet view article find links to article
Kim, Byunghan (2001). "Simplicity, and stability in there". The Journal of Symbolic Logic. 66 (2): 822–836. doi:10.2307/2695047. JSTOR 2695047. S2CID 7033889Saul Kripke (6,542 words) [view diff] exact match in snippet view article find links to article
Saul A. (March 1959). "A completeness theorem in modal logic". Journal of Symbolic Logic. 24 (1): 1–14. doi:10.2307/2964568. JSTOR 2964568. S2CID 44300271Banach–Tarski paradox (6,855 words) [view diff] exact match in snippet view article find links to article
the Banach–Tarski paradox: A solution to De Groot's problem". Journal of Symbolic Logic. 70 (3): 946–952. CiteSeerX 10.1.1.502.6600. doi:10.2178/jsl/1122038921Independence-friendly logic (7,126 words) [view diff] exact match in snippet view article find links to article
Wilfrid (2001), "Some combinatorics of imperfect information". Journal of Symbolic Logic 66: 673-684. Eklund, Matti and Kolak, Daniel, "Is Hintikka’s LogicTetration (6,455 words) [view diff] exact match in snippet view article find links to article
Goodstein (1947). "Transfinite ordinals in recursive number theory". Journal of Symbolic Logic. 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486. S2CID 1318943Equivalent definitions of mathematical structures (3,272 words) [view diff] exact match in snippet view article find links to article
theory: the only sentences preserved under isomorphisms", The Journal of Symbolic Logic, 56 (3): 932–948, doi:10.2178/jsl/1183743741. The Univalent FoundationsGraham Priest bibliography (3,901 words) [view diff] exact match in snippet view article find links to article
"Inconsistent Models of Arithmetic II; the Genera Case" (PDF). Journal of Symbolic Logic. 65 (4): 1519–29. doi:10.2307/2695062. JSTOR 2695062. S2CID 43401296Indescribable cardinal (1,900 words) [view diff] exact match in snippet view article find links to article
(1991). "Indescribable Cardinals and Elementary Embeddings". Journal of Symbolic Logic. 56 (2): 439–457. doi:10.2307/2274692. JSTOR 2274692. KanamoriMark Johnston (philosopher) (2,240 words) [view diff] exact match in snippet view article
Nelson (1940). "The Calculus of Individuals and Its Uses". The Journal of Symbolic Logic. 5 (2): 45–55. doi:10.2307/2266169. ISSN 0022-4812. JSTOR 2266169Existence (13,423 words) [view diff] exact match in snippet view article find links to article
Philosophical Studies (Minneapolis), Vol. 9 (1958), pp. 60–63". Journal of Symbolic Logic. 32 (2). doi:10.2307/2271672. ISSN 0022-4812. JSTOR 2271672. S2CID 121302904Harry R. Lewis (4,524 words) [view diff] exact match in snippet view article find links to article
of Computation by Harry R. Lewis; Christos H. Papadimitriou". Journal of Symbolic Logic. 49 (3): 989–990. doi:10.2307/2274157. JSTOR 2274157. S2CID 118180594