Остановите войну!
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 45 matches
- 1969
- Michael Anderson:
Note on the mortality problem for shift state trees. Notre Dame J. Formal Log. 10(3): 275-276 (1969) - Richard Beatty:
Peirce's development of quantifiers and of predicate logic. Notre Dame J. Formal Log. 10(1): 64-76 (1969) - Stephen L. Bloom:
A semi-completeness theorem. Notre Dame J. Formal Log. 10(3): 303-308 (1969) - Karel L. de Bouvère:
Remarks on classification of theories by their complete extensions. Notre Dame J. Formal Log. 10(1): 1-17 (1969) - Diana Brignole:
Equational characterization of Nelson algebra. Notre Dame J. Formal Log. 10(3): 285-297 (1969) - John Thomas Canty:
The numerical epsilon. Notre Dame J. Formal Log. 10(1): 47-63 (1969) - John Thomas Canty:
Leśniewski's terminological explanations as recursive concepts. Notre Dame J. Formal Log. 10(4): 337-369 (1969) - Robert D. Carnes:
A reduction procedure for Sheffer stroke formulas. Notre Dame J. Formal Log. 10(3): 331-335 (1969) - Nino B. Cocchiarella:
A substitution free axiom set for second order logic. Notre Dame J. Formal Log. 10(1): 18-30 (1969) - John Corcoran, George Weaver:
Logical consequence in modal logic: Natural deduction in S5. Notre Dame J. Formal Log. 10(4): 370-384 (1969) - Trevor Evans:
An unsolvable problem concerning identities. Notre Dame J. Formal Log. 10(4): 413-414 (1969) - William J. Frascella:
The non-existence of a certain combinatorial design on an infinite set. Notre Dame J. Formal Log. 10(3): 317-323 (1969) - Thomas J. Grilliot:
Selection functions for recursive functionals. Notre Dame J. Formal Log. 10(3): 225-234 (1969) - Desmond Paul Henry:
Leśniewski's ontology and some medieval logicians. Notre Dame J. Formal Log. 10(3): 324-326 (1969) - John T. Kearns:
Two views of variables. Notre Dame J. Formal Log. 10(2): 163-180 (1969) - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. II. Notre Dame J. Formal Log. 10(3): 277-284 (1969) - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. III. Notre Dame J. Formal Log. 10(4): 385-409 (1969) - C. W. Leininger:
Concerning some proposals for quantum logic. Notre Dame J. Formal Log. 10(1): 95-96 (1969) - C. A. Meredith:
Equational postulates for the Sheffer stroke. Notre Dame J. Formal Log. 10(3): 266-270 (1969) - C. A. Meredith:
Terminal functors permissible with syllogistic. Notre Dame J. Formal Log. 10(3): 309-312 (1969) - Eugen Mihailescu:
L'ordre d'incomplètitude pour le système d'équivalence la négation et la réciprocité. Notre Dame J. Formal Log. 10(4): 425-451 (1969) - J. Kent Minichiello:
An extension of negationless logic. Notre Dame J. Formal Log. 10(3): 298-302 (1969) - William C. Nemitz:
Semi-Boolean lattices. Notre Dame J. Formal Log. 10(3): 235-238 (1969) - Charles D. Parsons:
Corrigendum to my paper: "A propositional calculus intermediate between the minimal calculus and the classical". Notre Dame J. Formal Log. 10(3): 336 (1969) - A. N. Prior:
Propositional calculus in implication and non-equivalence. Notre Dame J. Formal Log. 10(3): 271-272 (1969) - A. N. Prior:
On the calculus MCC. Notre Dame J. Formal Log. 10(3): 273-274 (1969) - A. N. Prior:
Corrigendum to C. A. Meredith's and my paper: "Equational logic". Notre Dame J. Formal Log. 10(4): 452 (1969) - Richard L. Purtill:
Doing logic by computer. Notre Dame J. Formal Log. 10(2): 150-162 (1969) - Juliusz Reichbach:
Some examples of different methods of formal proofs with generalizations of the satisfiability definition. Notre Dame J. Formal Log. 10(2): 214-224 (1969) - M. K. Rennie:
Theory of procedures. I. Simple conditionals. Notre Dame J. Formal Log. 10(1): 97-112 (1969)
skipping 15 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-04-25 06:44 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