default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDolph Ulrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j16]Larry Wos, Dolph Ulrich, Branden Fitelson:
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. J. Autom. Reason. 29(2): 107-124 (2002)- [i2]Larry Wos, Dolph Ulrich, Branden Fitelson:
Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. CoRR cs.LO/0211014 (2002) - [i1]Larry Wos, Dolph Ulrich, Branden Fitelson:
XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus. CoRR cs.LO/0211015 (2002) - 2001
- [j15]Dolph Ulrich:
A Legacy Recalled and a Tradition Continued. J. Autom. Reason. 27(2): 97-122 (2001)
1990 – 1999
- 1996
- [j14]Dolph Ulrich:
The shortest possible length of the longest implicational axiom. J. Philos. Log. 25(1): 101-108 (1996) - 1992
- [j13]Dolph Ulrich:
On the Incompleteness of a Descending Chain of Extensions of Implicational S5. Math. Log. Q. 38(1): 321-323 (1992)
1980 – 1989
- 1988
- [j12]Dolph Ulrich:
A five-valued model of the E-p-q-theses. Notre Dame J. Formal Log. 29(1): 137-138 (1988) - 1985
- [j11]Dolph Ulrich:
A Descending Chain of Incomplete Extensions of Implicational S 5. Math. Log. Q. 31(13): 201-208 (1985) - 1984
- [j10]Dolph Ulrich:
Answer to a Question Suggested by Schumm. Math. Log. Q. 30(25): 385-387 (1984) - 1983
- [j9]Dolph Ulrich:
The finite model property and recursive bounds on the size of countermodels. J. Philos. Log. 12(4): 477-480 (1983) - 1981
- [j8]Dolph Ulrich:
Strict Implication in A Sequence of Extensions of S4. Math. Log. Q. 27(13-14): 201-212 (1981) - [j7]Dolph Ulrich:
RMLC: solution to a problem left open by Lemmon. Notre Dame J. Formal Log. 22(2): 187-189 (1981)
1970 – 1979
- 1978
- [j6]Dolph Ulrich:
Semantics for S4.1.2. Notre Dame J. Formal Log. 19(3): 461-464 (1978) - 1976
- [j5]Dolph Ulrich:
On a Property of Matrices for Subsystems of IC+. Math. Log. Q. 22(1): 193-194 (1976) - [j4]Dolph Ulrich:
Generalization of a Result of Pahi's. Math. Log. Q. 22(1): 437-438 (1976) - [j3]Dolph Ulrich:
On a modal system of R. A. Bull's. Notre Dame J. Formal Log. 17(3): 479-480 (1976) - 1974
- [j2]Dolph Ulrich:
Erratum: "Some results concerning finite models for sentential calculi". Notre Dame J. Formal Log. 15(4): 648 (1974) - 1972
- [j1]Dolph Ulrich:
Some results concerning finite models for sentential calculi. Notre Dame J. Formal Log. 13(3): 363-368 (1972)
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.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
