![](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 36 matches
- 1984
- Evelyn M. Barker:
Unneeded surgery on Aristotle's Prior analytics. Notre Dame J. Formal Log. 25(4): 323-331 (1984) - Fabio Bellissima:
On the relationship between one-point frames and degrees of unsatisfiability of modal formulas. Notre Dame J. Formal Log. 25(2): 117-126 (1984) - Ermanno Bencivenga:
Finitary consistency of a free arithmetic. Notre Dame J. Formal Log. 25(3): 224-226 (1984) - Johan van Benthem:
Tense logic and time. Notre Dame J. Formal Log. 25(1): 1-16 (1984) - Claudio Bernardi:
A shorter proof of a recent result by R. Di Paola. Notre Dame J. Formal Log. 25(4): 390-393 (1984) - Daniel Bonevac:
Skolem fragments. Notre Dame J. Formal Log. 25(3): 227-232 (1984) - George Boolos:
Trees and finite satisfiability: proof of a conjecture of Burgess. Notre Dame J. Formal Log. 25(3): 193-197 (1984) - Mark A. Brown:
Generalized quantifiers and the square of opposition. Notre Dame J. Formal Log. 25(4): 303-322 (1984) - Barry Burd:
Decomposable collections of sets. Notre Dame J. Formal Log. 25(1): 17-26 (1984) - John P. Burgess:
Read on relevance: a rejoinder. Notre Dame J. Formal Log. 25(3): 217-223 (1984) - Richard L. Call:
Constructing sequent rules for generalized propositional logics. Notre Dame J. Formal Log. 25(2): 171-178 (1984) - John W. Dawson:
Addenda and corrigenda to: "The published work of Kurt Gödel: an annotated bibliography". Notre Dame J. Formal Log. 25(3): 283-287 (1984) - George Englebretsen:
Opposition. Notre Dame J. Formal Log. 25(1): 79-85 (1984) - Leonard Goddard:
The nature of reflexive paradoxes. II. Notre Dame J. Formal Log. 25(1): 27-58 (1984) - Theodore Hailperin:
Probability logic. Notre Dame J. Formal Log. 25(3): 198-212 (1984) - Philip Hugly, Charles Sayward:
Do we need quantification? Notre Dame J. Formal Log. 25(4): 289-302 (1984) - Jacek K. Kabzinski:
An axiomatization of the equivalential fragment of the three-valued logic of Lukasiewicz. Notre Dame J. Formal Log. 25(4): 354-356 (1984) - Matt Kaufmann:
Some remarks on equivalence in infinitary and stationary logic. Notre Dame J. Formal Log. 25(4): 383-389 (1984) - Michal Krynicki, Alistair H. Lachlan, Jouko Väänänen:
Vector spaces and binary quantifiers. Notre Dame J. Formal Log. 25(1): 72-78 (1984) - Per Lindström:
On certain lattices of degrees of interpretability. Notre Dame J. Formal Log. 25(2): 127-140 (1984) - Vincenzo Manca
, Antonino Salibra
:
First-order theories as many-sorted algebras. Notre Dame J. Formal Log. 25(1): 86-94 (1984) - David Marker:
A model theoretic proof of Feferman's preservation theorem. Notre Dame J. Formal Log. 25(3): 213-216 (1984) - John Neil Martin:
Epistemic semantics for classical and intuitionistic logic. Notre Dame J. Formal Log. 25(2): 105-116 (1984) - Franco Montagna:
The predicate modal logic of provability. Notre Dame J. Formal Log. 25(2): 179-189 (1984) - Shigeo Ohama:
Conjunctive normal forms and weak modal logics without the axiom of necessity. Notre Dame J. Formal Log. 25(2): 141-151 (1984) - Veikko Rantala:
Facts and the choice of logical foundations. Notre Dame J. Formal Log. 25(4): 347-353 (1984) - John Rybak, Janet Rybak:
Mechanizing logic. I. Map logic extended formally to relational arguments. Notre Dame J. Formal Log. 25(3): 250-264 (1984) - Janet Rybak, John Rybak:
Mechanizing logic. II. Automated map logic method for relational arguments on paper and by computer. Notre Dame J. Formal Log. 25(3): 265-282 (1984) - Saharon Shelah
:
A pair of nonisomorphic ≡∞λ models of power λ for λ singular with λω=λ. Notre Dame J. Formal Log. 25(2): 97-104 (1984) - Albert M. Sweet:
A pragmatic theory of locally standard grammar. Notre Dame J. Formal Log. 25(4): 364-382 (1984)
skipping 6 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-06-20 16:01 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