Alan Rose

According to our database1, Alan Rose authored at least 20 papers between 1951 and 1987.

Collaborative distances:
  • no known Dijkstra number2.
  • no known Erdős number3.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1987
A Strongly Complete Formalisation of a 5-Valued Propositional Calculus.
Math. Log. Q., 1987

A Formalisation, Using non-Standard Rules, of A 5-Valued Propositional Calculus.
Math. Log. Q., 1987

1986
A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept.
Math. Log. Q., 1986

1984
Generalised Functional Completeness of Sets of M-Valued Sheffer Functions.
Math. Log. Q., 1984

A Generalisation of Slupecki's Criterion for Functional Completeness.
Math. Log. Q., 1984

1983
Scompleteness of Sets of Three-Valued Sheffer Function.
Math. Log. Q., 1983

1982
A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens.
Math. Log. Q., 1982

1978
A Three-Valued Model for Set Theory.
Math. Log. Q., 1978

A Note on Formalisation by the Method of Description of Truth-Tables.
Math. Log. Q., 1978

Formalisations of Further N0-Valued Lukasiewicz Propositional Calculi.
J. Symb. Log., 1978

1977
Simplified formalizations of fragments of the propositional calculus.
Notre Dame Journal of Formal Logic, 1977

1976
Formalisations With Non-Standard Degrees of Completeness.
Math. Log. Q., 1976

A Note on the Existence of Tautologies in Certain Propositional Calculi Without Propositional Variables.
Math. Log. Q., 1976

1975
A note on the existence of tautologies without constants.
Math. Log. Q., 1975

1962
Extensions of Some Theorems of Anderson and Belnap.
J. Symb. Log., 1962

1960
An Extension of a Theorem of Margaris.
J. Symb. Log., 1960

1953
The M-Valued Calculus of Non-Contradiction.
J. Symb. Log., 1953

Conditioned Disjunction as a Primitive Connective for the Erweiterter Aussagenkalkul.
J. Symb. Log., 1953

1952
An Extension of Computational Logic.
J. Symb. Log., 1952

1951
Strong Completeness of Fragments of the Propositional Calculus.
J. Symb. Log., 1951


  Loading...