Melvin Fitting

Orcid: 0000-0003-0229-114X

Affiliations:
  • City University of New York, NY, USA


According to our database1, Melvin Fitting authored at least 94 papers between 1970 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Family of Strict/Tolerant Logics.
J. Philos. Log., 2021

2020
First-order justification logic with constant domain semantics.
J. Log. Comput., 2020

Bilattice Basics.
FLAP, 2020

About 'Binding Modalities'.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019
What Are Justification Logics?
Fundam. Informaticae, 2019

2017
Paraconsistent Logic, Evidence, and Justification.
Stud Logica, 2017

On Modalities and Quantifiers.
Fundam. Informaticae, 2017

2016
Realization using the model existence theorem.
J. Log. Comput., 2016

Modal logics, justification logics, and realization.
Ann. Pure Appl. Log., 2016

2015
Cut-Free Proof Systems for Geach Logics.
FLAP, 2015

Modal interpolation via nested sequents.
Ann. Pure Appl. Log., 2015

Quasi-Realization.
Proceedings of the Logic, Language, and Computation, 2015

2014
Nested Sequents for Intuitionistic Logics.
Notre Dame J. Formal Log., 2014

Preface.
Fundam. Informaticae, 2014

The life and work of Sergei Artemov.
Ann. Pure Appl. Log., 2014

Editorial.
Ann. Pure Appl. Log., 2014

Possible world semantics for first-order logic of proofs.
Ann. Pure Appl. Log., 2014

2012
Torben Braüner, Hybrid Logic and its Proof-Theory, Applied Logic Series Volume 37, Springer, 2011, pp. XIII+231. ISBN: 978-94-007-0001-7 (hardcover) EURO 99, 95, ISBN: 978-94-007-0002-4 (eBook) EURO 99, 99.
Stud Logica, 2012

Prefixed tableaus and nested sequents.
Ann. Pure Appl. Log., 2012

2011
Reasoning About Games.
Stud Logica, 2011

Nested Sequents and Prefixed Tableaus.
Proceedings of the TABLEAUX 2011, 2011

2010
Justification logics and hybrid logics.
J. Appl. Log., 2010

2009
How True It Is = Who Says It's True.
Stud Logica, 2009

Realizations and LP.
Ann. Pure Appl. Log., 2009

Reasoning with Justifications.
Proceedings of the Towards Mathematical Philosophy, 2009

2008
Justification logics, logics of knowledge, and conservativity.
Ann. Math. Artif. Intell., 2008

Explicit Logics of Knowledge and Conservativity.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

S4LPand Local Realizability.
Proceedings of the Computer Science, 2008

2007
Correction to FOIL <i>Axiomatized Studia Logica</i> , 84: 1-22, 2006.
Stud Logica, 2007

Modal proof theory.
Proceedings of the Handbook of Modal Logic., 2007

2006
FOIL Axiomatized.
Stud Logica, 2006

2005
A Quantified Logic of Evidence.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

The logic of proofs, semantically.
Ann. Pure Appl. Log., 2005

A Mistake on My Part.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004
First-order intensional logic.
Ann. Pure Appl. Log., 2004

2002
Fixpoint semantics for logic programming a survey.
Theor. Comput. Sci., 2002

Modal Logics Between Propositional and First-order.
J. Log. Comput., 2002

Interpolation for First Order S5.
J. Symb. Log., 2002

Bisimulations and Boolean Vectors.
Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

2001
Term-Modal Logics.
Stud Logica, 2001

2000
Modality and Databases.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Databases and Higher Types.
Proceedings of the Computational Logic, 2000

Belief, Names, and Modes of Presentation.
Proceedings of the Advances in Modal Logic 3, 2000

1999
Barcan Both Ways.
J. Appl. Non Class. Logics, 1999

On Quantified Modal Logic.
Fundam. Informaticae, 1999

A Simple Propositional S5 Tableau System.
Ann. Pure Appl. Log., 1999

1998
leanTAP Revisited.
J. Log. Comput., 1998

Higher-Order Modal Logic - A Sketch.
Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Bertrand Russell, Herbrand's Theorem, and the Assignment Statement.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997
A Theory of Truth that Prefers Falsehood.
J. Philos. Log., 1997

1996
A Modal Herbrand Theorem.
Fundam. Informaticae, 1996

A Program to Compute Gödel-Löb Fixpoints.
Bull. EATCS, 1996

First-Order Logic and Automated Theorem Proving, Second Edition.
Graduate Texts in Computer Science, Springer, ISBN: 978-1-4612-2360-3, 1996

1995
Tableaus for many-valued modal logic.
Stud Logica, 1995

Annotated Revision Specification Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1994
Metric Methods Three Examples and a Theorem.
J. Log. Program., 1994

Tableaux for Logic Programming.
J. Autom. Reason., 1994

Kleene's Three Valued Logics and Their Children.
Fundam. Informaticae, 1994

1993
The Family of Stable Models.
J. Log. Program., 1993

Metric Methods in the Semantics of Logic Programs.
Proceedings of the Logic Programming, 1993

1992
The Pure Logic of Necessitation.
J. Log. Comput., 1992

Editorial.
J. Log. Comput., 1992

Many-Valued Model Logics II.
Fundam. Informaticae, 1992

Many-Valued Non-Monotonic Modal Logics.
Proceedings of the Logical Foundations of Computer Science, 1992

Many-Valued Semantics for Logic Programming.
Proceedings of the Logic Programming, 1992

1991
Kleene's Logic, Generalized.
J. Log. Comput., 1991

Bilattices and the Semantics of Logic Programming.
J. Log. Program., 1991

Many-valued modal logics.
Fundam. Informaticae, 1991

Well-Founded Semantics, Generalized.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Modal Logic Should Say More Than It Does.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
First-Order Logic and Automated Theorem Proving
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4684-0357-2, 1990

Destructive Modal Resolution.
J. Log. Comput., 1990

Bilattices in Logic Prograrnming.
Proceedings of the 20th International Symposium on Multiple-Valued Logic, 1990

1989
Bilattices and the theory of truth.
J. Philos. Log., 1989

Negation As Refutation
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Pseudo-Boolean valued prolog.
Stud Logica, 1988

First-Order Modal Tableaux.
J. Autom. Reason., 1988

Stratified and Three-valued Logic Programming Semantics.
Proceedings of the Logic Programming, 1988

1987
Enumeration Operators and Modular Logic Programming.
J. Log. Program., 1987

Resolution for Intuitionistic Logic.
Proceedings of the Methodologies for Intelligent Systems, 1987

1986
Partial Models and Logic Programming.
Theor. Comput. Sci., 1986

Notes on the mathematical aspects of Kripke's theory of truth.
Notre Dame J. Formal Log., 1986

Logic programming semantics using a compact data structure.
Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, 1986

1985
A Kripke-Kleene Semantics for Logic Programs.
J. Log. Program., 1985

A Deterministic Prolog Fixpoint Semantics.
J. Log. Program., 1985

1984
Linear Reasoning in Modal Logic.
J. Symb. Log., 1984

1978
Elementary Formal Systems for Hyperarithmetical Relations.
Math. Log. Q., 1978

1977
A tableau system for propositional S5.
Notre Dame J. Formal Log., 1977

1975
A modal logic ε-calculus.
Notre Dame J. Formal Log., 1975

1973
Model Existence Theorems for Modal and Intuitionistic Logics.
J. Symb. Log., 1973

1972
ε-calculus based axiom systems for some propositional modal logics.
Notre Dame J. Formal Log., 1972

Tableau methods of proof for modal logics.
Notre Dame J. Formal Log., 1972

1971
A tableau proof method admitting the empty domain.
Notre Dame J. Formal Log., 1971

1970
An Embedding of Classical Logic in S4.
J. Symb. Log., 1970


  Loading...