Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jsyml/jsyml33.bht:"
download as .bib file
@article{DBLP:journals/jsyml/Andrews68,
author = {Peter B. Andrews},
title = {On Simplifying the Matrix of a {WFF}},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {180--192},
year = {1968},
url = {https://doi.org/10.2307/2269865},
doi = {10.2307/2269865},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Andrews68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BoolosP68,
author = {George Boolos and
Hilary Putnam},
title = {Degrees of Unsolvability of Constructible Sets of Integers},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {497--513},
year = {1968},
url = {https://doi.org/10.2307/2271357},
doi = {10.2307/2271357},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/BoolosP68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Bull68,
author = {R. A. Bull},
title = {An Algebraic Study of Tense Logics with Linear Time},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {27--38},
year = {1968},
url = {https://doi.org/10.2307/2270049},
doi = {10.2307/2270049},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Bull68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Call68,
author = {Richard L. Call},
title = {A Minimal Canonically Complete M-Valued Proper Logic for Each {M}},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {108--110},
year = {1968},
url = {https://doi.org/10.2307/2270060},
doi = {10.2307/2270060},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Call68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Clay68,
author = {Robert E. Clay},
title = {The Consistency of Lesniewski's Mereology Relative to the Real Number
System},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {251--257},
year = {1968},
url = {https://doi.org/10.2307/2269870},
doi = {10.2307/2269870},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Clay68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/CudiaS68,
author = {Dennis F. Cudia and
Wilson E. Singletary},
title = {The Post Correspondence Problem},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {418--430},
year = {1968},
url = {https://doi.org/10.2307/2270327},
doi = {10.2307/2270327},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/CudiaS68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Dalen68,
author = {Dirk van Dalen},
title = {Reducibilities in Intuitionistic Topology},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {412--417},
year = {1968},
url = {https://doi.org/10.2307/2270326},
doi = {10.2307/2270326},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Dalen68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/DrebenT68,
author = {Burton Dreben and
James Thomson},
title = {Annual Meeting of the Association for Symbolic Logic},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {636--645},
year = {1968},
url = {https://doi.org/10.2307/2271434},
doi = {10.2307/2271434},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/DrebenT68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Driscoll68,
author = {Graham C. Driscoll Jr.},
title = {Metarecursively Enumerable Sets and Their Metadegrees},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {389--411},
year = {1968},
url = {https://doi.org/10.2307/2270325},
doi = {10.2307/2270325},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Driscoll68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Feferman68,
author = {Solomon Feferman},
title = {Systems of Predicative Analysis, {II:} Representations of Ordinals},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {193--220},
year = {1968},
url = {https://doi.org/10.2307/2269866},
doi = {10.2307/2269866},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Feferman68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Fenstad68,
author = {Jens Erik Fenstad},
title = {On the Completeness of Some Transfinite Recursive Progressions of
Axiomatic Theories},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {69--76},
year = {1968},
url = {https://doi.org/10.2307/2270053},
doi = {10.2307/2270053},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Fenstad68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Ferguson68,
author = {Don C. Ferguson},
title = {Infinite Products of Recursive Equivalence Types},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {221--230},
year = {1968},
url = {https://doi.org/10.2307/2269867},
doi = {10.2307/2269867},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Ferguson68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Fitch68,
author = {Frederic Brenton Fitch},
title = {A Note on Recursive Relations},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {107},
year = {1968},
url = {https://doi.org/10.2307/2270059},
doi = {10.2307/2270059},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Fitch68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Geiser68,
author = {James R. Geiser},
title = {Nonstandard Logic},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {236--250},
year = {1968},
url = {https://doi.org/10.2307/2269869},
doi = {10.2307/2269869},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Geiser68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Goe68,
author = {George Goe},
title = {Modifications of Quine's {ML} and Inclusive Quantification Systems},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {39--42},
year = {1968},
url = {https://doi.org/10.2307/2270050},
doi = {10.2307/2270050},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Goe68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hamilton68,
author = {Alan G. Hamilton},
title = {An Unsolved Problem in the Theory of Constructive Order Types},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {565--567},
year = {1968},
url = {https://doi.org/10.2307/2271363},
doi = {10.2307/2271363},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hamilton68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Jockusch68,
author = {Carl G. Jockusch Jr.},
title = {Uniformly Introreducible Sets},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {521--536},
year = {1968},
url = {https://doi.org/10.2307/2271359},
doi = {10.2307/2271359},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Jockusch68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Kreisel68,
author = {Georg Kreisel},
title = {A Survey of Proof Theory},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {321--388},
year = {1968},
url = {https://doi.org/10.2307/2270324},
doi = {10.2307/2270324},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Kreisel68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Kunen68,
author = {Kenneth Kunen},
title = {Implicit Definability and Infinitary Languages},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {446--451},
year = {1968},
url = {https://doi.org/10.2307/2270330},
doi = {10.2307/2270330},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Kunen68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lachlan68,
author = {Alistair H. Lachlan},
title = {Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {431--443},
year = {1968},
url = {https://doi.org/10.2307/2270328},
doi = {10.2307/2270328},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lachlan68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lambert68,
author = {W. M. Lambert Jr.},
title = {A Notion of Effectiveness in Arbitrary Structures},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {577--602},
year = {1968},
url = {https://doi.org/10.2307/2271367},
doi = {10.2307/2271367},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lambert68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LeBlanc68,
author = {Hugues LeBlanc},
title = {Subformula Theorems for N-Sequents},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {161--179},
year = {1968},
url = {https://doi.org/10.2307/2269864},
doi = {10.2307/2269864},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LeBlanc68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LeBlanc68a,
author = {Hugues LeBlanc},
title = {A Simplified Account of Validity and Implication for Quantificational
Logic},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {231--235},
year = {1968},
url = {https://doi.org/10.2307/2269868},
doi = {10.2307/2269868},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LeBlanc68a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LeBlanc68b,
author = {Hugues LeBlanc},
title = {On Meyer and Lambert's Quantificational Calculus {FQ}},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {275--280},
year = {1968},
url = {https://doi.org/10.2307/2269874},
doi = {10.2307/2269874},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LeBlanc68b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Lindstrom68,
author = {Per Lindstr{\"{o}}m},
title = {Remarks on Some Theorems of Keisler},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {571--576},
year = {1968},
url = {https://doi.org/10.2307/2271366},
doi = {10.2307/2271366},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Lindstrom68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/LobDD68,
author = {M. H. Lob and
F. R. Drake and
John Derrick},
title = {Meeting of the Association for Symbolic Logic Leeds 1967},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {490},
year = {1968},
url = {https://doi.org/10.2307/2270367},
doi = {10.2307/2270367},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/LobDD68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Madison68,
author = {Eugene W. Madison},
title = {Structures Elementarily Closed Relative to a Model for Arithmetic},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {101--104},
year = {1968},
url = {https://doi.org/10.2307/2270057},
doi = {10.2307/2270057},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Madison68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/McKay68,
author = {C. G. McKay},
title = {The Decidability of Certain Intermediate Propositional Logics},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {258--264},
year = {1968},
url = {https://doi.org/10.2307/2269871},
doi = {10.2307/2269871},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/McKay68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/MeyerL68,
author = {Robert K. Meyer and
Karel Lambert},
title = {Universally Free Logic and Standard Quantification Theory},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {8--26},
year = {1968},
url = {https://doi.org/10.2307/2270048},
doi = {10.2307/2270048},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/MeyerL68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Oberschelp68,
author = {Arnold Oberschelp},
title = {On the Craig-Lyndon Interpolation Theorem},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {271--274},
year = {1968},
url = {https://doi.org/10.2307/2269873},
doi = {10.2307/2269873},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Oberschelp68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Pogorzelski68,
author = {Witold A. Pogorzelski},
title = {On the Scope of the Classical Deduction Theorem},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {77--81},
year = {1968},
url = {https://doi.org/10.2307/2270054},
doi = {10.2307/2270054},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Pogorzelski68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Pour-El68,
author = {Marian Boykan Pour{-}El},
title = {Effectively Extensible Theories},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {56--68},
year = {1968},
url = {https://doi.org/10.2307/2270052},
doi = {10.2307/2270052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Pour-El68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Prawitz68,
author = {Dag Prawitz},
title = {Hauptsatz for Higher Order Logic},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {452--457},
year = {1968},
url = {https://doi.org/10.2307/2270331},
doi = {10.2307/2270331},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Prawitz68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Rennie68,
author = {M. K. Rennie},
title = {{S3(S)} = {S3.5}},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {444--445},
year = {1968},
url = {https://doi.org/10.2307/2270329},
doi = {10.2307/2270329},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Rennie68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/RescherG68,
author = {Nicholas Rescher and
James W. Garson},
title = {Topological Logic},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {537--548},
year = {1968},
url = {https://doi.org/10.2307/2271360},
doi = {10.2307/2271360},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/RescherG68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Richardson68,
author = {Daniel Richardson},
title = {Some Undecidable Problems Involving Elementary Functions of a Real
Variable},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {514--520},
year = {1968},
url = {https://doi.org/10.2307/2271358},
doi = {10.2307/2271358},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/Richardson68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Richter68,
author = {Wayne Richter},
title = {Constructively Accessible Ordinal Numbers},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {43--55},
year = {1968},
url = {https://doi.org/10.2307/2270051},
doi = {10.2307/2270051},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Richter68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Robinson68,
author = {T. Thacher Robinson},
title = {Independence of Two Nice Sets of Axioms for the Propositional Calculus},
journal = {J. Symb. Log.},
volume = {33},
number = {2},
pages = {265--270},
year = {1968},
url = {https://doi.org/10.2307/2269872},
doi = {10.2307/2269872},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Robinson68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Rosenberg68,
author = {James Rosenberg},
title = {Functional Completeness in One Variable},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {105--106},
year = {1968},
url = {https://doi.org/10.2307/2270058},
doi = {10.2307/2270058},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Rosenberg68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/RoutleyM68,
author = {Richard Routley and
Hugh Alexander Montgomery},
title = {On Systems Containing Aristotle's Thesis},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {82--96},
year = {1968},
url = {https://doi.org/10.2307/2270055},
doi = {10.2307/2270055},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/RoutleyM68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/RoutleyM68a,
author = {Richard Routley and
Hugh Alexander Montgomery},
title = {The Inadequacy of Kripke's Semantical Analysis of {D2} and {D3}},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {568},
year = {1968},
url = {https://doi.org/10.2307/2271364},
doi = {10.2307/2271364},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/RoutleyM68a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Smullyan68,
author = {Raymond M. Smullyan},
title = {Uniform Gentzen Systems},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {549--559},
year = {1968},
url = {https://doi.org/10.2307/2271361},
doi = {10.2307/2271361},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Smullyan68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Smullyan68a,
author = {Raymond M. Smullyan},
title = {Analytic Cut},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {560--564},
year = {1968},
url = {https://doi.org/10.2307/2271362},
doi = {10.2307/2271362},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Smullyan68a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Thomas68,
author = {Ivo Thomas},
title = {Replacement in Some Modal Systems},
journal = {J. Symb. Log.},
volume = {33},
number = {4},
pages = {569--570},
year = {1968},
url = {https://doi.org/10.2307/2271365},
doi = {10.2307/2271365},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Thomas68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Thomason68,
author = {Richmond H. Thomason},
title = {On the Strong Semantical Completeness of the Intuitionistic Predicate
Calculus},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {1--7},
year = {1968},
url = {https://doi.org/10.2307/2270047},
doi = {10.2307/2270047},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Thomason68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Zeman68,
author = {J. Jay Zeman},
title = {Some Calculi with Strong Negation Primitive},
journal = {J. Symb. Log.},
volume = {33},
number = {1},
pages = {97--100},
year = {1968},
url = {https://doi.org/10.2307/2270056},
doi = {10.2307/2270056},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Zeman68.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Zeman68a,
author = {J. Jay Zeman},
title = {Lemmon-Style Bases for the Systems {S1} \({}^{\mbox{ring}}\)- S4\({}^{\mbox{ring}}\)},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {458--461},
year = {1968},
url = {https://doi.org/10.2307/2270332},
doi = {10.2307/2270332},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Zeman68a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Zeman68b,
author = {J. Jay Zeman},
title = {The Semisubstitutivity of Strict Implication},
journal = {J. Symb. Log.},
volume = {33},
number = {3},
pages = {462--464},
year = {1968},
url = {https://doi.org/10.2307/2270333},
doi = {10.2307/2270333},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Zeman68b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-26 13:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
