Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ndjfl/ndjfl22.bht:"
@article{DBLP:journals/ndjfl/AlpsN81, author = {Robert A. Alps and Robert C. Neveln}, title = {A predicate logic based on indefinite description and two notions of identity}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {251--263}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883460}, doi = {10.1305/NDJFL/1093883460}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/AlpsN81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Blum81, author = {Alex Blum}, title = {Quine on an alleged non sequitur}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {249--250}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883459}, doi = {10.1305/NDJFL/1093883459}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Blum81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Brandom81, author = {Robert Brandom}, title = {Semantic paradox of material implication}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {129--132}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883397}, doi = {10.1305/NDJFL/1093883397}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Brandom81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/BrownR81, author = {Frank Markham Brown and Sergiu Rudeanu}, title = {Consequences, consistency, and independence in Boolean algebras}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {45--62}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883339}, doi = {10.1305/NDJFL/1093883339}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/BrownR81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Burgess81, author = {John P. Burgess}, title = {The completeness of intuitionistic propositional calculus for its intended interpretation}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {17--28}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883336}, doi = {10.1305/NDJFL/1093883336}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Burgess81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Burgess81a, author = {John P. Burgess}, title = {Quick completeness proofs for some logics of conditionals}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {76--84}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883341}, doi = {10.1305/NDJFL/1093883341}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Burgess81a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Burgess81b, author = {John P. Burgess}, title = {Relevance: a fallacy?}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {97--104}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883393}, doi = {10.1305/NDJFL/1093883393}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Burgess81b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Burgess81c, author = {John P. Burgess}, title = {Careful choices - a last word on Borel selectors}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {219--226}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883456}, doi = {10.1305/NDJFL/1093883456}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Burgess81c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Caicedo81, author = {Xavier Caicedo}, title = {On extensions of L\({}_{\mbox{{\(\omega\)}{\(\omega\)}}}\)(Q\({}_{\mbox{1)}}\)}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {85--93}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883342}, doi = {10.1305/NDJFL/1093883342}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Caicedo81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Clarke81, author = {Bowman L. Clarke}, title = {A calculus of individuals based on "connection"}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {204--218}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883455}, doi = {10.1305/NDJFL/1093883455}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Clarke81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Dekker81, author = {J. C. E. Dekker}, title = {Automorphisms of {\(\omega\)}-cubes}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {120--128}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883396}, doi = {10.1305/NDJFL/1093883396}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Dekker81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Garavaglia81, author = {Steven Garavaglia}, title = {Forking in modules}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {155--162}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883400}, doi = {10.1305/NDJFL/1093883400}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Garavaglia81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Hardegree81, author = {Gary M. Hardegree}, title = {Material implication in orthomodular (and Boolean) lattices}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {163--182}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883401}, doi = {10.1305/NDJFL/1093883401}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Hardegree81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Hendry81, author = {Herbert E. Hendry}, title = {Does {IPC} have a binary indigenous Sheffer function?}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {183--186}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883402}, doi = {10.1305/NDJFL/1093883402}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Hendry81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/HuglyS81, author = {Philip Hugly and Charles Sayward}, title = {Completeness theorems for two propositional logics in which identity diverges from mutual entailment}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {269--282}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883462}, doi = {10.1305/NDJFL/1093883462}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/HuglyS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Jech81, author = {Thomas Jech}, title = {On the number of generators of an ideal}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {105--108}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883394}, doi = {10.1305/NDJFL/1093883394}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Jech81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/JenningsJS81, author = {Raymond E. Jennings and D. K. Johnston and Peter K. Schotch}, title = {The n-adic first-order undefinability of the Geach formula}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {375--378}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883516}, doi = {10.1305/NDJFL/1093883516}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/JenningsJS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/JenningsS81, author = {Raymond E. Jennings and Peter K. Schotch}, title = {Probabilistic considerations on modal semantics}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {227--238}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883457}, doi = {10.1305/NDJFL/1093883457}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/JenningsS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/JenningsS81a, author = {Raymond E. Jennings and Peter K. Schotch}, title = {Some remarks on (weakly) weak modal logics}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {309--314}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883512}, doi = {10.1305/NDJFL/1093883512}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/JenningsS81a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Kearns81, author = {John T. Kearns}, title = {A more satisfactory description of the semantics of justification}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {109--119}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883395}, doi = {10.1305/NDJFL/1093883395}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Kearns81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Krom81, author = {Melven R. Krom}, title = {Equivalents of a weak axiom of choice}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {283--285}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883463}, doi = {10.1305/NDJFL/1093883463}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Krom81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/McArthur81, author = {Robert P. McArthur}, title = {Anderson's deontic logic and relevant implication}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {145--154}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883399}, doi = {10.1305/NDJFL/1093883399}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/McArthur81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Paulos81, author = {John A. Paulos}, title = {Probabilistic, truth-value, and standard semantics and the primacy of predicate logic}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {11--16}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883335}, doi = {10.1305/NDJFL/1093883335}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Paulos81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Pettorossi81, author = {Alberto Pettorossi}, title = {A property which guarantees termination in weak combinatory logic and subtree replacement systems}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {344--356}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883514}, doi = {10.1305/NDJFL/1093883514}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Pettorossi81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Pottinger81, author = {Garrel Pottinger}, title = {The Church-Rosser theorem for the typed {\(\lambda\)}-calculus with surjective pairing}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {264--268}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883461}, doi = {10.1305/NDJFL/1093883461}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Pottinger81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Schmidt81, author = {J{\"{u}}rgen Schmidt}, title = {Algebraic studies of first-order enlargements}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {315--343}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883513}, doi = {10.1305/NDJFL/1093883513}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Schmidt81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Shelah81, author = {Saharon Shelah}, title = {On the number of nonisomorphic models of cardinality {\(\lambda\)} L\({}_{\mbox{{\(\infty\)}{\(\lambda\)}}}\)-equivalent to a fixed model}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {5--10}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883334}, doi = {10.1305/NDJFL/1093883334}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Shelah81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Shelah81a, author = {Saharon Shelah}, title = {On Fleissner's diamond}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {29--35}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883337}, doi = {10.1305/NDJFL/1093883337}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Shelah81a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Shelah81b, author = {Saharon Shelah}, title = {On saturation for a predicate}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {239--248}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883458}, doi = {10.1305/NDJFL/1093883458}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Shelah81b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Shelah81c, author = {Saharon Shelah}, title = {On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {301--308}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883511}, doi = {10.1305/NDJFL/1093883511}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Shelah81c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Smorynski81, author = {Craig Smorynski}, title = {Cofinal extensions of nonstandard models of arithmetic}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {133--144}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883398}, doi = {10.1305/NDJFL/1093883398}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Smorynski81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Smorynski81a, author = {Craig Smorynski}, title = {Elementary extensions of recursively saturated models of arithmetic}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {3}, pages = {193--203}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883454}, doi = {10.1305/NDJFL/1093883454}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Smorynski81a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Smorynski81b, author = {Craig Smorynski}, title = {Fifty years of self-reference in arithmetic}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {357--374}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883515}, doi = {10.1305/NDJFL/1093883515}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Smorynski81b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Ulrich81, author = {Dolph Ulrich}, title = {{RMLC:} solution to a problem left open by Lemmon}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {2}, pages = {187--189}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883403}, doi = {10.1305/NDJFL/1093883403}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Ulrich81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Wagner81, author = {Steven J. Wagner}, title = {Tonk}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {4}, pages = {289--300}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883510}, doi = {10.1305/NDJFL/1093883510}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Wagner81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Wilson81, author = {Thomas P. Wilson}, title = {General models of set theory}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {36--44}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883338}, doi = {10.1305/NDJFL/1093883338}, timestamp = {Thu, 21 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Wilson81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ndjfl/Wolf81, author = {Robert S. Wolf}, title = {A highly efficient "transfinite recursive definitions" axiom for set theory}, journal = {Notre Dame J. Formal Log.}, volume = {22}, number = {1}, pages = {63--75}, year = {1981}, url = {https://doi.org/10.1305/ndjfl/1093883340}, doi = {10.1305/NDJFL/1093883340}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ndjfl/Wolf81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.