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 37 matches
- 1981
- Robert A. Alps, Robert C. Neveln:
A predicate logic based on indefinite description and two notions of identity. Notre Dame J. Formal Log. 22(3): 251-263 (1981) - Alex Blum:
Quine on an alleged non sequitur. Notre Dame J. Formal Log. 22(3): 249-250 (1981) - Robert Brandom:
Semantic paradox of material implication. Notre Dame J. Formal Log. 22(2): 129-132 (1981) - Frank Markham Brown, Sergiu Rudeanu:
Consequences, consistency, and independence in Boolean algebras. Notre Dame J. Formal Log. 22(1): 45-62 (1981) - John P. Burgess:
The completeness of intuitionistic propositional calculus for its intended interpretation. Notre Dame J. Formal Log. 22(1): 17-28 (1981) - John P. Burgess:
Quick completeness proofs for some logics of conditionals. Notre Dame J. Formal Log. 22(1): 76-84 (1981) - John P. Burgess:
Relevance: a fallacy? Notre Dame J. Formal Log. 22(2): 97-104 (1981) - John P. Burgess:
Careful choices - a last word on Borel selectors. Notre Dame J. Formal Log. 22(3): 219-226 (1981) - Xavier Caicedo:
On extensions of Lωω(Q1). Notre Dame J. Formal Log. 22(1): 85-93 (1981) - Bowman L. Clarke:
A calculus of individuals based on "connection". Notre Dame J. Formal Log. 22(3): 204-218 (1981) - J. C. E. Dekker:
Automorphisms of ω-cubes. Notre Dame J. Formal Log. 22(2): 120-128 (1981) - Steven Garavaglia:
Forking in modules. Notre Dame J. Formal Log. 22(2): 155-162 (1981) - Gary M. Hardegree:
Material implication in orthomodular (and Boolean) lattices. Notre Dame J. Formal Log. 22(2): 163-182 (1981) - Herbert E. Hendry:
Does IPC have a binary indigenous Sheffer function? Notre Dame J. Formal Log. 22(2): 183-186 (1981) - Philip Hugly, Charles Sayward:
Completeness theorems for two propositional logics in which identity diverges from mutual entailment. Notre Dame J. Formal Log. 22(3): 269-282 (1981) - Thomas Jech:
On the number of generators of an ideal. Notre Dame J. Formal Log. 22(2): 105-108 (1981) - Raymond E. Jennings, D. K. Johnston, Peter K. Schotch:
The n-adic first-order undefinability of the Geach formula. Notre Dame J. Formal Log. 22(4): 375-378 (1981) - Raymond E. Jennings, Peter K. Schotch:
Probabilistic considerations on modal semantics. Notre Dame J. Formal Log. 22(3): 227-238 (1981) - Raymond E. Jennings, Peter K. Schotch:
Some remarks on (weakly) weak modal logics. Notre Dame J. Formal Log. 22(4): 309-314 (1981) - John T. Kearns:
A more satisfactory description of the semantics of justification. Notre Dame J. Formal Log. 22(2): 109-119 (1981) - Melven R. Krom:
Equivalents of a weak axiom of choice. Notre Dame J. Formal Log. 22(3): 283-285 (1981) - Robert P. McArthur:
Anderson's deontic logic and relevant implication. Notre Dame J. Formal Log. 22(2): 145-154 (1981) - John A. Paulos:
Probabilistic, truth-value, and standard semantics and the primacy of predicate logic. Notre Dame J. Formal Log. 22(1): 11-16 (1981) - Alberto Pettorossi:
A property which guarantees termination in weak combinatory logic and subtree replacement systems. Notre Dame J. Formal Log. 22(4): 344-356 (1981) - Garrel Pottinger:
The Church-Rosser theorem for the typed λ-calculus with surjective pairing. Notre Dame J. Formal Log. 22(3): 264-268 (1981) - Jürgen Schmidt:
Algebraic studies of first-order enlargements. Notre Dame J. Formal Log. 22(4): 315-343 (1981) - Saharon Shelah:
On the number of nonisomorphic models of cardinality λ L∞λ-equivalent to a fixed model. Notre Dame J. Formal Log. 22(1): 5-10 (1981) - Saharon Shelah:
On Fleissner's diamond. Notre Dame J. Formal Log. 22(1): 29-35 (1981) - Saharon Shelah:
On saturation for a predicate. Notre Dame J. Formal Log. 22(3): 239-248 (1981) - Saharon Shelah:
On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements. Notre Dame J. Formal Log. 22(4): 301-308 (1981)
skipping 7 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-10-06 06:38 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