![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 41 matches
- 1999
- Arthur W. Apter:
On the Consistency Strength of Two Choiceless Cardinal Patterns. Notre Dame J. Formal Log. 40(3): 341-345 (1999) - John P. Burgess:
Which Modal Logic Is the Right One? Notre Dame J. Formal Log. 40(1): 81-93 (1999) - John P. Burgess:
Book Review: Stewart Shapiro. Philosophy of Mathematics: Structure and Ontology. Notre Dame J. Formal Log. 40(2): 283-291 (1999) - James Cain:
The Theory of Computability Developed in Terms of Satisfaction. Notre Dame J. Formal Log. 40(4): 515-532 (1999) - James Cargile:
Proposition and Tense. Notre Dame J. Formal Log. 40(2): 250-257 (1999) - Walter Alexandre Carnielli, João Marcos:
Limits for Paraconsistent Calculi. Notre Dame J. Formal Log. 40(3): 375-390 (1999) - Fabrice Correia:
Adequacy Results for Some Priorean Modal Propositional Logics. Notre Dame J. Formal Log. 40(2): 236-249 (1999) - Marcel Crabbé:
The 3-Stratifiable Theorems of NFU∞. Notre Dame J. Formal Log. 40(2): 174-182 (1999) - Christian Delhommé, Marianne Morillon:
Dependent Choices and Weak Compactness. Notre Dame J. Formal Log. 40(4): 568-573 (1999) - Michael Detlefsen:
Introduction to Special Issue on George S. Boolos. Notre Dame J. Formal Log. 40(1): 1-2 (1999) - Olivier Esser, Roland Hinnion:
Antifoundation and Transitive Closure in the System of Zermelo. Notre Dame J. Formal Log. 40(2): 197-205 (1999) - Solomon Feferman:
Logic, Logics, and Logicism. Notre Dame J. Formal Log. 40(1): 31-54 (1999) - Janet Folina:
Book Review: Michael Resnik. Mathematics as a Science of Patterns. Notre Dame J. Formal Log. 40(3): 455-472 (1999) - Craig Fraser:
Book Review: Paolo Mancuso. Philosophy of Mathematics and Mathematical Practice in the Seventeenth Century. Notre Dame J. Formal Log. 40(3): 447-454 (1999) - Kyriakos Keremedis, Horst Herrlich:
Powers of 2. Notre Dame J. Formal Log. 40(3): 346-351 (1999) - M. Randall Holmes:
Subsystems of Quine's "New Foundations" with Predicativity Restrictions. Notre Dame J. Formal Log. 40(2): 183-196 (1999) - Frederick A. Johnson:
Parry Syllogisms. Notre Dame J. Formal Log. 40(3): 414-419 (1999) - Frederick A. Johnson:
Rejection and Truth-Value Gaps. Notre Dame J. Formal Log. 40(4): 574-577 (1999) - Darryl Jung:
Russell, Presupposition, and the Vicious-Circle Principle. Notre Dame J. Formal Log. 40(1): 55-80 (1999) - Kyriakos Keremedis, Eleftherios Tachtsis:
Nonconstructive Properties of Well-Ordered T2 topological Spaces. Notre Dame J. Formal Log. 40(4): 548-553 (1999) - Marcus Kracht:
Modal Logics That Need Very Large Frames. Notre Dame J. Formal Log. 40(2): 141-173 (1999) - Marcus Kracht:
Book Review: V. V. Rybakov. Admissibility of Logical Inference Rules. Notre Dame J. Formal Log. 40(4): 578-587 (1999) - Hannes Leitgeb:
Truth and the Liar in De Morgan-Valued Models. Notre Dame J. Formal Log. 40(4): 496-514 (1999) - Gert-Jan C. Lokhorst:
Ernst Mally's Deontik (1926). Notre Dame J. Formal Log. 40(2): 273-282 (1999) - Penelope Maddy:
Logic and the Discursive Intellect. Notre Dame J. Formal Log. 40(1): 94-115 (1999) - Reinhard Muskens
:
On Partial and Paraconsistent Logics. Notre Dame J. Formal Log. 40(3): 352-374 (1999) - André Nies
:
A New Spectrum of Recursive Models. Notre Dame J. Formal Log. 40(3): 307-314 (1999) - Alex Orenstein:
Reconciling Aristotle and Frege. Notre Dame J. Formal Log. 40(3): 391-413 (1999) - Charles D. Parsons:
George Boolos. Notre Dame J. Formal Log. 40(1): 3-5 (1999) - Stephen Pollard:
Book Review: Penelope Maddy. Naturalism in Mathematics. Notre Dame J. Formal Log. 40(2): 293-306 (1999)
skipping 11 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-02 08:49 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