• Publications
  • Influence
First-Order Logic and Automated Theorem Proving
  • M. Fitting
  • Mathematics, Computer Science
  • Graduate Texts in Computer Science
  • 1 July 1990
TLDR
This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style and is intended for those interested in computer science and mathematics at the beginning graduate level. Expand
Proof Methods for Modal and Intuitionistic Logics
One / Background.- Two / Analytic Modal Tableaus and Consistency Properties.- Three / Logical Consequence, Compactness, Interpolation, and Other Topics.- Four / Axiom Systems and Natural Deduction.-Expand
A Kripke-Kleene Semantics for Logic Programs
  • M. Fitting
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1 December 1985
The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query,Expand
The logic of proofs, semantically
  • M. Fitting
  • Computer Science
  • Ann. Pure Appl. Log.
  • 1 February 2005
TLDR
This semantics is used to give new proofs of several basic results concerning LP, and the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Expand
Fixpoint Semantics for Logic Programming a Survey
  • M. Fitting
  • Computer Science
  • Theor. Comput. Sci.
  • 1 July 2001
TLDR
This paper summarizes one variety of approaches to the semantics of logic programs: that based on fixpoint theory, and hopes readers will see parallels with, and the divergences from the better known fixpoint treatments developed for other programming methodologies. Expand
Bilattices and the Semantics of Logic Programming
  • M. Fitting
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1 June 1991
TLDR
Bilattices are a family of truth-value spaces that allow elegantly for missing or conflicting information, and a fixed-point semantics is developed for logic programming, allowing any bilattice as the space of truth values. Expand
First-Order Modal Logic
Preface. 1. Propositional Modal Logic. 2. Tableau Proof Systems. 3. Axiom Systems. 4. Quantified Modal Logic. 5. First-Order Tableaus. 6. First-Order Axiom Systems. 7. Equality. 8. Existence andExpand
Many-valued modal logics
  • M. Fitting
  • Computer Science
  • Fundam. Informaticae
  • 1 November 1991
TLDR
Two families of many-valued modal logics are investigated, characterized using Kripke models that allow formulas to take values in a finiteMany-valued logic, at each possible world. Expand
...
1
2
3
4
5
...