Остановите войну!
for scientists:
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 47 matches
- 1967
- Michael Anderson:
Note on an inequality of Tibor Rado. Notre Dame J. Formal Log. 8(1-2): 159-160 (1967) - Ignacio Angelelli:
On identity and interchangeability in Leibnitz and Frege. Notre Dame J. Formal Log. 8(1-2): 94-100 (1967) - Florencio G. Asenjo:
Rings of term-relation numbers as non-standard models. Notre Dame J. Formal Log. 8(1-2): 24-26 (1967) - John Bacon:
Syllogistic without existence. Notre Dame J. Formal Log. 8(3): 195-219 (1967) - Dorothy Bollman:
Formal nonassociative number theory. Notre Dame J. Formal Log. 8(1-2): 9-16 (1967) - Carl E. Bredlau:
Regressive functions and combinatorial functions. Notre Dame J. Formal Log. 8(4): 301-310 (1967) - R. A. Bull:
On the extension of S4 with CLMpMLp. Notre Dame J. Formal Log. 8(4): 325-329 (1967) - R. A. Bull:
On three related extensions of S4. Notre Dame J. Formal Log. 8(4): 330-334 (1967) - Max J. Cresswell:
A Henkin completeness for T. Notre Dame J. Formal Log. 8(3): 186-190 (1967) - M. J. Cresswell:
Alternative completeness theorems for modal systems. Notre Dame J. Formal Log. 8(4): 339-345 (1967) - Burton Dreben, Hilary Putnam:
The Craig interpolation lemma. Notre Dame J. Formal Log. 8(3): 229-233 (1967) - Rolf A. Eberle:
Some complete calculi of individuals. Notre Dame J. Formal Log. 8(4): 267-278 (1967) - William J. Frascella:
Combinatorial designs on infinite sets. Notre Dame J. Formal Log. 8(1-2): 27-47 (1967) - Michael C. Gemignani:
A characterization of Sm by means of topological geometries. Notre Dame J. Formal Log. 8(3): 220-224 (1967) - Michael C. Gemignani:
On the independence of certain axioms in the definition of an m-arrangement. Notre Dame J. Formal Log. 8(3): 225-226 (1967) - Abraham Goetz:
Algebraic independence in an infinite Steiner triple system. Notre Dame J. Formal Log. 8(1-2): 51-55 (1967) - Edward A. Hacker:
Number system for the immediate inferences and the syllogism in Aristotelian logic. Notre Dame J. Formal Log. 8(4): 318-320 (1967) - Edward A. Hacker, William Tuthill Parry:
Pure numerical Boolean syllogisms. Notre Dame J. Formal Log. 8(4): 321-324 (1967) - I. J. Heath:
Omitting the replacement schema in recursive arithmetic. Notre Dame J. Formal Log. 8(3): 234-238 (1967) - Hans Hermes:
In memoriam: Wilhelm Ackermann (1896-1962). Notre Dame J. Formal Log. 8(1-2): 1-8 (1967) - John T. Kearns:
The contribution of Leśniewski. Notre Dame J. Formal Log. 8(1-2): 61-93 (1967) - Karel Lambert:
Free logic and the concept of existence. Notre Dame J. Formal Log. 8(1-2): 133-144 (1967) - Czeslaw Lejewski:
A single axiom for the mereological notion of proper part. Notre Dame J. Formal Log. 8(4): 279-285 (1967) - Storrs McCall:
Contrariety. Notre Dame J. Formal Log. 8(1-2): 121-132 (1967) - Stephen H. McCleary:
Primitive recursive computations. Notre Dame J. Formal Log. 8(4): 311-317 (1967) - C. G. McKay:
Some completeness results for intermediate propositional logics. Notre Dame J. Formal Log. 8(3): 191-194 (1967) - C. G. McKay:
Implicationless wffs. in IC. Notre Dame J. Formal Log. 8(3): 227-228 (1967) - Eugen Mihailescu:
Decision problem in the classical logic. Notre Dame J. Formal Log. 8(3): 239-253 (1967) - Albert A. Mullin:
On new theorems for elementary number theory. Notre Dame J. Formal Log. 8(4): 353-356 (1967) - Walter H. O'Briant:
Leibnitz's preference for an intensional logic (A reply to Mr. Parkinson). Notre Dame J. Formal Log. 8(3): 254-256 (1967)
skipping 17 more matches
loading more results
failed to load more results, please try again later
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-05-26 12:57 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