Robert K. Meyer

According to our database1, Robert K. Meyer authored at least 54 papers between 1966 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
On the Ternary Relation and Conditionality.
J. Philos. Log., 2012

2008
AI, me and Lewis (Abelian Implication, Material Equivalence and C I Lewis 1920).
J. Philos. Log., 2008

2007
The Relevant Equivalence Property.
Log. J. IGPL, 2007

2006
The Better Bubbling Lemma.
Proceedings of the Second International Workshop on Developments in Computational Models, 2006

2004
Ternary relations and relevant semantics.
Ann. Pure Appl. Log., 2004

2002
The Semantics of Entailment Omega.
Notre Dame J. Formal Log., 2002

2000
Computational Dialectics for Argument-Based Agent Systems.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

What Entailment Can do for Type Theory.
Proceedings of the ICALP Workshops 2000, 2000

1998
⊃E is Admissible in "true" relevant arithmetic.
J. Philos. Log., 1998

Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie.".
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
Combinators and Structurally Free Logic.
Log. J. IGPL, 1997

Logic for Two: The Semantics of Distributive Substructural Logics.
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997

1995
Linear Analytic Tableaux.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994
The finite model property for BCK arid BCIW.
Stud Logica, 1994

1993
The semantics ofR4.
J. Philos. Log., 1993

1992
A Structurally Complete Fragment of Relevant Logic.
Notre Dame J. Formal Log., 1992

The Admissibility of γ in R4.
Notre Dame J. Formal Log., 1992

Whither Relevant Arithmetic?
J. Symb. Log., 1992

1991
Implementing the 'Fool's Model' of Combinatory Logic.
J. Autom. Reason., 1991

1989
Completeness and conservative extension results for some boolean relevant logics.
Stud Logica, 1989

1988
Further Results on Proof Theories For Semilattice Logics.
Math. Log. Q., 1988

Towards Efficient "Knowledge-Based" Automated Theorem Proving for Non-Standard Logics.
Proceedings of the 9th International Conference on Automated Deduction, 1988

Automated theorem-proving in non-classical logics.
Research Notes in Theoretical Computer Science, Pitman, ISBN: 978-0-273-08781-6, 1988

1987
A Contractionless Semilattice Semantics.
J. Symb. Log., 1987

1986
Sentential constants in R and R⌝.
Stud Logica, 1986

Conservative Extension in Relevant Arithmetic.
Math. Log. Q., 1986

Idempotents in R.
Math. Log. Q., 1986

Logic on the Australian plan.
J. Philos. Log., 1986

The KRIPKE Automated Theorem Proving System.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1984
Inconsistent Models for Relevant Arithmetics.
J. Symb. Log., 1984

1983
A note on ℝ<sub>-></sub> matrices.
Notre Dame J. Formal Log., 1983

The fundamental S-theorem - a corollary.
Notre Dame J. Formal Log., 1983

1982
Solution to the P-W Problem.
J. Symb. Log., 1982

The ineliminability of E! in free quantification theory without identity.
J. Philos. Log., 1982

1980
Career induction for quantifiers.
Notre Dame J. Formal Log., 1980

1979
A Note on the Admissibility of Cut in Relevant Tableau Systems.
Math. Log. Q., 1979

Career induction stops here (and here = 2).
J. Philos. Log., 1979

1978
On the Inconsistency of Systems Similar to F <sup>*</sup> <sub> 21</sub>.
J. Symb. Log., 1978

1977
First degree formulas in Curry's LD.
Notre Dame J. Formal Log., 1977

1976
Metacompleteness.
Notre Dame J. Formal Log., 1976

Negation disarmed.
Notre Dame J. Formal Log., 1976

1974
Completeness of relevant quantification theories.
Notre Dame J. Formal Log., 1974

Choice and descriptions in enriched intensional languages - I.
J. Philos. Log., 1974

New axiomatics for relevant logics, I.
J. Philos. Log., 1974

1973
On conserving positive logics.
Notre Dame J. Formal Log., 1973

1972
On relevantly derivable disjunctions.
Notre Dame J. Formal Log., 1972

Matters of separation.
Notre Dame J. Formal Log., 1972

The semantics of entailment - III.
J. Philos. Log., 1972

The semantics of entailment - II.
J. Philos. Log., 1972

1970
E and S4.
Notre Dame J. Formal Log., 1970

1969
E, R, and gama.
J. Symb. Log., 1969

1968
Universally Free Logic and Standard Quantification Theory.
J. Symb. Log., 1968

1966
Pure Denumerable Lukasiewiczian Implication.
J. Symb. Log., 1966

Pure Three-Valued Lukasiewiczian Implication.
J. Symb. Log., 1966


  Loading...