default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert K. Meyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j45]J. C. Beall, Ross T. Brady, J. Michael Dunn, Allen Hazen, Edwin D. Mares
, Robert K. Meyer, Graham Priest, Greg Restall, David Ripley, John K. Slaney, Richard Sylvan:
On the Ternary Relation and Conditionality. J. Philos. Log. 41(3): 595-612 (2012)
2000 – 2009
- 2008
- [j44]Robert K. Meyer:
AI, me and Lewis (Abelian Implication, Material Equivalence and C I Lewis 1920). J. Philos. Log. 37(2): 169-181 (2008) - 2007
- [j43]Lloyd Humberstone, Robert K. Meyer:
The Relevant Equivalence Property. Log. J. IGPL 15(2): 165-181 (2007) - 2006
- [c8]Robert K. Meyer:
The Better Bubbling Lemma. DCM@ICALP 2006: 77-84 - 2004
- [j42]Robert K. Meyer:
Ternary relations and relevant semantics. Ann. Pure Appl. Log. 127(1-3): 195-217 (2004) - 2002
- [j41]Mariangiola Dezani-Ciancaglini, Robert K. Meyer, Yoko Motohama:
The Semantics of Entailment Omega. Notre Dame J. Formal Log. 43(3): 129-145 (2002) - 2000
- [c7]Robert K. Meyer:
What Entailment Can do for Type Theory. ICALP Satellite Workshops 2000: 355-356 - [c6]Hajime Sawamura, Yuichi Umeda, Robert K. Meyer:
Computational Dialectics for Argument-Based Agent Systems. ICMAS 2000: 271-278
1990 – 1999
- 1998
- [j40]Robert K. Meyer:
⊃E is Admissible in "true" relevant arithmetic. J. Philos. Log. 27(4): 327-351 (1998) - [c5]Jacques Riche, Robert K. Meyer:
Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie.". CSL 1998: 224-240 - 1997
- [j39]J. Michael Dunn, Robert K. Meyer:
Combinators and Structurally Free Logic. Log. J. IGPL 5(4): 505-537 (1997) - [c4]John K. Slaney, Robert K. Meyer:
Logic for Two: The Semantics of Distributive Substructural Logics. ECSQARU-FAPR 1997: 554-567 - 1995
- [c3]Robert K. Meyer, Michael A. McRobbie, Nuel Belnap:
Linear Analytic Tableaux. TABLEAUX 1995: 278-293 - 1994
- [j38]Robert K. Meyer, Hiroakira Ono:
The finite model property for BCK arid BCIW. Stud Logica 53(1): 107-118 (1994) - 1993
- [j37]Edwin D. Mares, Robert K. Meyer:
The semantics ofR4. J. Philos. Log. 22(1): 95-110 (1993) - 1992
- [j36]Harvey Friedman, Robert K. Meyer:
Whither Relevant Arithmetic? J. Symb. Log. 57(3): 824-831 (1992) - [j35]Edwin D. Mares, Robert K. Meyer:
The Admissibility of γ in R4. Notre Dame J. Formal Log. 33(2): 197-206 (1992) - [j34]John K. Stanley, Robert K. Meyer:
A Structurally Complete Fragment of Relevant Logic. Notre Dame J. Formal Log. 33(4): 561-566 (1992) - 1991
- [j33]Robert K. Meyer, Martin W. Bunder, Lawrence Powers:
Implementing the 'Fool's Model' of Combinatory Logic. J. Autom. Reason. 7(4): 597-630 (1991)
1980 – 1989
- 1989
- [j32]Steve Giambrone, Robert K. Meyer:
Completeness and conservative extension results for some boolean relevant logics. Stud Logica 48(1): 1-14 (1989) - 1988
- [b1]Paul B. Thistlewaite, Michael A. McRobbie, Robert K. Meyer:
Automated theorem-proving in non-classical logics. Research Notes in Theoretical Computer Science, Pitman 1988, ISBN 978-0-273-08781-6, pp. 1-154 - [j31]Robert K. Meyer, Errol P. Martin, Steve Giambrone, Alasdair Urquhart:
Further Results on Proof Theories For Semilattice Logics. Math. Log. Q. 34(4): 301-304 (1988) - [c2]Michael A. McRobbie, Robert K. Meyer, Paul B. Thistlewaite:
Towards Efficient "Knowledge-Based" Automated Theorem Proving for Non-Standard Logics. CADE 1988: 197-217 - 1987
- [j30]Steve Giambrone, Robert K. Meyer, Alasdair Urquhart:
A Contractionless Semilattice Semantics. J. Symb. Log. 52(2): 526-529 (1987) - 1986
- [j29]Robert K. Meyer, Errol P. Martin:
Logic on the Australian plan. J. Philos. Log. 15(3): 305-332 (1986) - [j28]Robert K. Meyer, Igor Urbas:
Conservative Extension in Relevant Arithmetic. Math. Log. Q. 32(1-5): 45-50 (1986) - [j27]Robert K. Meyer:
Idempotents in R. Math. Log. Q. 32(25-30): 407-408 (1986) - [j26]Robert K. Meyer:
Sentential constants in R and R⌝. Stud Logica 45(3): 301-327 (1986) - [c1]Paul B. Thistlewaite, Michael A. McRobbie, Robert K. Meyer:
The KRIPKE Automated Theorem Proving System. CADE 1986: 705-706 - 1984
- [j25]Robert K. Meyer, Chris Mortensen:
Inconsistent Models for Relevant Arithmetics. J. Symb. Log. 49(3): 917-929 (1984) - 1983
- [j24]Robert K. Meyer:
A note on ℝ-> matrices. Notre Dame J. Formal Log. 24(4): 450-472 (1983) - [j23]Robert Dwyer, Errol P. Martin, Robert K. Meyer:
The fundamental S-theorem - a corollary. Notre Dame J. Formal Log. 24(4): 509-516 (1983) - 1982
- [j22]Robert K. Meyer, Ermanno Bencivenga, Karel Lambert:
The ineliminability of E! in free quantification theory without identity. J. Philos. Log. 11(2): 229-231 (1982) - [j21]Errol P. Martin, Robert K. Meyer:
Solution to the P-W Problem. J. Symb. Log. 47(4): 869-887 (1982) - 1980
- [j20]Robert K. Meyer:
Career induction for quantifiers. Notre Dame J. Formal Log. 21(3): 539-548 (1980)
1970 – 1979
- 1979
- [j19]Robert K. Meyer:
Career induction stops here (and here = 2). J. Philos. Log. 8(1): 361-371 (1979) - [j18]Michael A. McRobbie, Robert K. Meyer:
A Note on the Admissibility of Cut in Relevant Tableau Systems. Math. Log. Q. 25(32): 511-512 (1979) - 1978
- [j17]Martin W. Bunder, Robert K. Meyer:
On the Inconsistency of Systems Similar to F * 21. J. Symb. Log. 43(1): 1-2 (1978) - 1977
- [j16]Robert K. Meyer:
First degree formulas in Curry's LD. Notre Dame J. Formal Log. 18(1): 181-191 (1977) - 1976
- [j15]Robert K. Meyer:
Negation disarmed. Notre Dame J. Formal Log. 17(2): 184-190 (1976) - [j14]Robert K. Meyer:
Metacompleteness. Notre Dame J. Formal Log. 17(4): 501-516 (1976) - 1974
- [j13]Robert K. Meyer:
New axiomatics for relevant logics, I. J. Philos. Log. 3(1-2): 53-86 (1974) - [j12]Richard Routley, Robert K. Meyer, Leonard Goddard:
Choice and descriptions in enriched intensional languages - I. J. Philos. Log. 3(3): 291-316 (1974) - [j11]J. Michael Dunn, Hugues Leblanc, Robert K. Meyer:
Completeness of relevant quantification theories. Notre Dame J. Formal Log. 15(1): 97-121 (1974) - 1973
- [j10]Robert K. Meyer:
On conserving positive logics. Notre Dame J. Formal Log. 14(2): 224-236 (1973) - 1972
- [j9]Richard Routley, Robert K. Meyer:
The semantics of entailment - II. J. Philos. Log. 1(1): 53-73 (1972) - [j8]Richard Routley, Robert K. Meyer:
The semantics of entailment - III. J. Philos. Log. 1(2): 192-208 (1972) - [j7]Hugues Leblanc, Robert K. Meyer:
Matters of separation. Notre Dame J. Formal Log. 13(2): 229-236 (1972) - [j6]Robert K. Meyer:
On relevantly derivable disjunctions. Notre Dame J. Formal Log. 13(4): 476-480 (1972) - 1970
- [j5]Robert K. Meyer:
E and S4. Notre Dame J. Formal Log. 11(2): 181-199 (1970)
1960 – 1969
- 1969
- [j4]Robert K. Meyer, J. Michael Dunn:
E, R, and gama. J. Symb. Log. 34(3): 460-474 (1969) - 1968
- [j3]Robert K. Meyer, Karel Lambert:
Universally Free Logic and Standard Quantification Theory. J. Symb. Log. 33(1): 8-26 (1968) - 1966
- [j2]Storrs McCall, Robert K. Meyer:
Pure Three-Valued Lukasiewiczian Implication. J. Symb. Log. 31(3): 399-405 (1966) - [j1]Robert K. Meyer:
Pure Denumerable Lukasiewiczian Implication. J. Symb. Log. 31(4): 575-580 (1966)
Coauthor Index
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-10-07 21:20 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:
