131 found
Order:
Disambiguations:
Melvin Fitting [129]Melvin C. Fitting [3]
  1.  16
    Melvin Fitting (2016). Modal Logics, Justification Logics, and Realization. Annals of Pure and Applied Logic 167 (8):615-648.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  32
    Melvin Fitting (2005). The Logic of Proofs, Semantically. Annals of Pure and Applied Logic 132 (1):1-25.
    A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   33 citations  
  3.  12
    Melvin Fitting, R. Mendelsohn & Roderic A. Girle (2002). First-Order Modal Logic. Bulletin of Symbolic Logic 8 (3):429-430.
    Direct download  
     
    Export citation  
     
    My bibliography   35 citations  
  4.  21
    Melvin Fitting, Bilattices and the Semantics of Logic Programming.
    Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result provides (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   12 citations  
  5.  1
    Melvin Fitting (1985). Proof Methods for Modal and Intuitionistic Logics. Journal of Symbolic Logic 50 (3):855-856.
    Direct download  
     
    Export citation  
     
    My bibliography   69 citations  
  6.  25
    Melvin Fitting, Bilattices In Logic Programming.
    Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   9 citations  
  7.  58
    Melvin C. Fitting, Many-Valued Modal Logics.
    Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and completeness are established.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  8.  35
    Melvin Fitting (2006). Bilattices Are Nice Things. In T. Bolander, V. Hendricks & S. A. Pedersen (eds.), Self-Reference. Csli Publications
    One approach to the paradoxes of self-referential languages is to allow some sentences to lack a truth value (or to have more than one). Then assigning truth values where possible becomes a fixpoint construction and, following Kripke, this is usually carried out over a partially ordered family of three-valued truth-value assignments. Some years ago Matt Ginsberg introduced the notion of bilattice, with applications to artificial intelligence in mind. Bilattices generalize the structure Kripke used in a very natural way, while making (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   11 citations  
  9.  53
    Melvin Fitting (2012). Prefixed Tableaus and Nested Sequents. Annals of Pure and Applied Logic 163 (3):291 - 313.
    Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10.  39
    Melvin Fitting (2004). First-Order Intensional Logic. Annals of Pure and Applied Logic 127 (1-3):171-193.
    First - order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently, several semantics based on counterparts have been examined, in a development that goes back to David Lewis. There is yet another line of research, using intensional objects, that traces back to Richard Montague. I have been involved with this line of development for some time. In the present paper, I briefly sketch several (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  11.  6
    Melvin Fitting (1969). Intuitionistic Logic, Model Theory and Forcing. Amsterdam, North-Holland Pub. Co..
  12.  25
    Melvin Fitting (2011). Reasoning About Games. Studia Logica 99 (1-3):143-169.
    is used to give a formalization of Artemov’s knowledge based reasoning approach to game theory, (KBR), [ 4 , 5 ]. Epistemic states of players are represented explicitly and reasoned about formally. We give a detailed analysis of the Centipede game using both proof theoretic and semantic machinery. This helps make the case that PDL + E can be a useful basis for the logical investigation of game theory.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  13.  28
    Melvin Fitting (2008). A Quantified Logic of Evidence. Annals of Pure and Applied Logic 152 (1):67-83.
    A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  14.  21
    Melvin Fitting, Modal Logics Between Propositional and First Order.
    One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T and D, adding such machinery produces (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  15.  61
    Melvin Fitting, Many-Valued Modal Logics II.
    Suppose there are several experts, with some dominating others (expert A dominates expert B if B says something is true whenever A says it is). Suppose, further, that each of the experts has his or her own view of what is possible — in other words each of the experts has their own Kripke model in mind (subject, of course, to the dominance relation that may hold between experts). How will they assign truth values to sentences in a common modal (...)
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  16.  24
    Melvin Fitting, Bisimulations and Boolean Vectors.
    A modal accessibility relation is just a transition relation, and so can be represented by a {0, 1} valued transition matrix. Starting from this observation, I first show that the machinery of matrices, over Boolean algebras more general than the two-valued one, is appropriate for investigating multi-modal semantics. Then I show that bisimulations have a rather elegant theory, when expressed in terms of transformations on Boolean vector spaces. The resulting theory is a curious hybrid, fitting between conventional modal semantics and (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  17.  45
    Melvin Fitting, Intensional Logic — Beyond First Order.
    Classical first-order logic can be extended in two different ways to serve as a foundation for mathematics: introduce higher orders, type theory, or introduce sets. As it happens, both approaches have natural analogs for quantified modal logics, both approaches date from the 1960’s, one is not very well-known, and the other is well-known as something else. I will present the basic semantic ideas of both higher order intensional logic, and intensional set theory. Before doing so, I’ll quickly sketch some necessary (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  18.  21
    Melvin Fitting, Fixpoint Semantics for Logic Programming A Survey.
    The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact (...)
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  19.  15
    Melvin Fitting (2009). Realizations and LP. Annals of Pure and Applied Logic 161 (3):368-387.
    LP can be seen as a logic of knowledge with justifications. See [S. Artemov, The logic of justification, The Review of Symbolic Logic 1 477–513] for a recent comprehensive survey of justification logics generally. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  20.  41
    Melvin Fitting, A Logic of Explicit Knowledge.
    A well-known problem with Hintikka-style logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpliciter, to knowledge for a reason. Then, as consequences become ‘further away’ from one’s basic knowledge, reasons for them become more complex, thus providing a kind of resource measurement. One kind of reason is (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  21.  39
    Melvin Fitting, Kleene's Three Valued Logics and Their Children.
    Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bilattices. Finally we show that for bilinear bilattices the extensions do not produce any new equivalences.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  22.  38
    Melvin Fitting, Kleene's Logic, Generalized.
    Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  23.  36
    Melvin Fitting (2002). Interpolation for First Order S5. Journal of Symbolic Logic 67 (2):621-634.
    An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first order S5 interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  24.  29
    Melvin Fitting, Reasoning with Justifications.
    This is an expository paper in which the basic ideas of a family of Justification Logics are presented. Justification Logics evolved from a logic called LP, introduced by Sergei Artemov [1, 3], which formed the central part of a project to provide an arithmetic semantics for propositional intuitionistic logic. The project was successful, but there was a considerable bonus: LP came to be understood as a logic of knowledge with explicit justifications and, as such, was capable of addressing in a (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  25.  47
    Melvin Fitting (1999). A Simple Propositional S5 Tableau System. Annals of Pure and Applied Logic 96 (1-3):107-115.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  26.  1
    Melvin Fitting (1992). The Stable Model Semantics for Logic Programming. [REVIEW] Journal of Symbolic Logic 57 (1):274-277.
    Direct download  
     
    Export citation  
     
    My bibliography   12 citations  
  27.  70
    Melvin Fitting, Justification Logics, Logics of Knowledge, and Conservativity.
    Several justification logics have been created, starting with the logic LP, [1]. These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. We begin by sketching the basics of justification logics and their relations with modal logics. Then we move to new material. Modal logics come in various strengths. For their corresponding justification logics, differing (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  28.  24
    Melvin Fitting, Intensional Logic. Stanford Encyclopedia of Philosophy.
    There is an obvious difference between what a term designates and what it means. At least it is obvious that there is a difference. In some way, meaning determines designation, but is not synonymous with it. After all, “the morning star” and “the evening star” both designate the planet Venus, but don't have the same meaning. Intensional logic attempts to study both designation and meaning and investigate the relationships between them.
    Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  29.  40
    Melvin Fitting, Justification Logics and Hybrid Logics.
    Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  30.  40
    Melvin Fitting, Many-Valued Non-Monotonic Modal Logics.
    Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This extends earlier work of ours on many-valued modal logics. Intended applications are to situations involving several reasoners, not just one (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  31.  35
    Melvin Fitting (1995). Tableaus for Many-Valued Modal Logic. Studia Logica 55 (1):63 - 87.
    We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-free tableau formulation is presented, and its completeness is proved.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  32.  17
    Melvin Fitting (1989). Bilattices and the Theory of Truth. Journal of Philosophical Logic 18 (3):225 - 256.
    While Kripke's original paper on the theory of truth used a three-valued logic, we believe a four-valued version is more natural. Its use allows for possible inconsistencies in information about the world, yet contains Kripke's development within it. Moreover, using a four-valued logic makes it possible to work with complete lattices rather than complete semi-lattices, and thus the mathematics is somewhat simplified. But more strikingly, the four-valued version has a wide, natural generalization to the family of interlaced bilattices. Thus, with (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  33.  13
    Melvin Fitting, S4lp and Local Realizability.
    The logic S4LP combines the modal logic S4 with the justification logic LP, both axiomatically and semantically. We introduce a simple restriction on the behavior of constants in S4LP, having no effect on the LP sublogic. Under this restriction some powerful derived rules are established. Then these are used to show completeness relative to a semantics having what we call the local realizability property: at each world and for each formula true at that world there is a realization also true (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  34.  17
    Melvin Fitting, Modality and Databases.
    Two things are done in this paper. First, a modal logic in which one can quantify over both objects and concepts is presented; a semantics and a tableau system are given. It is a natural modal logic, extending standard versions, and capable of addressing several well-known philosophical difficulties successfully. Second, this modal logic is used to introduce a rather different way of looking at relational databases. The idea is to treat records as possible worlds, record entries as objects, and attributes (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  35.  3
    Melvin Fitting (2014). Nested Sequents for Intuitionistic Logics. Notre Dame Journal of Formal Logic 55 (1):41-61.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  36.  15
    Melvin Fitting, Databases and Higher Types.
    Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be developed for such databases, based on a higher type modal/intensional logic.
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  37.  31
    Melvin Fitting, Modal Logic Should Say More Than It Does.
    First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, as well as the well-known problems with equality, non-rigid designators, definite descriptions, and nondesignating terms. We show how all these problems disappear when modal language is made more expressive in a simple, natural way. We present a semantic tableaux system for the enhanced logic, and (very) briefly discuss implementation issues.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  38.  5
    Melvin Fitting (1973). A Modal Logic Analog of Smullyan's Fundamental Theorem. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 19 (1):1-16.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39.  13
    Melvin Fitting (1986). Notes on the Mathematical Aspects of Kripke's Theory of Truth. Notre Dame Journal of Formal Logic 27 (1):75-88.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  40.  25
    Melvin Fitting, Herbrand's Theorem for a Modal Logic.
    Herbrand’s theorem is a central fact about classical logic, [9, 10]. It provides a constructive method for associating, with each first-order formula X, a sequence of formulas X1, X2, X3, . . . , so that X has a first-order proof if and only if some Xi is a tautology. Herbrand’s theorem serves as a constructive alternative to..
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  41.  38
    Melvin Fitting (1997). A Theory of Truth That Prefers Falsehood. Journal of Philosophical Logic 26 (5):477-500.
    We introduce a subclass of Kripke's fixed points in which falsehood is the preferred truth value. In all of these the truthteller evaluates to false, while the liar evaluates to undefined (or overdefined). The mathematical structure of this family of fixed points is investigated and is shown to have many nice features. It is noted that a similar class of fixed points, preferring truth, can also be studied. The notion of intrinsic is shown to relativize to these two subclasses. The (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  42.  13
    Melvin Fitting (1972). Tableau Methods of Proof for Modal Logics. Notre Dame Journal of Formal Logic 13 (2):237-247.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  43.  47
    Melvin Fitting (2012). Barcan Both Ways. Journal of Applied Non-Classical Logics 9 (2-3):329-344.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  44.  4
    Melvin Fitting (1978). Elementary Formal Systems for Hyperarithmetical Relations. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (1-6):25-30.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. Melvin Fitting (1998). First-Order Logic and Automated Theorem Proving. Studia Logica 61 (2):300-302.
     
    Export citation  
     
    My bibliography   5 citations  
  46.  24
    Melvin Fitting, The Realization Theorem for S5 a Simple, Constructive Proof.
    Justification logics are logics of knowledge in which explicit reasons are formally represented. Standard logics of knowledge have justification logic analogs. Connecting justification logics and logics of knowledge are Realization Theorems. In this paper we give a new, constructive proof of the Realization Theorem connecting S5 and its justification analog, JS5. This proof is, I believe, the simplest in the literature.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  47.  49
    Melvin Fitting, Possible World Semantics for First Order Lp.
    First we have individual variables, as usual in first-order logics. (We do not have individual constants, but this is a minor point.) The propositional logic LP has justification constants, but in FOLP these are generalized to allow individual variables as arguments. Thus we have as justification constants c, c(x), c(x, y), . . . . Similarly LP has justification variables, but in FOLP these can be parametrized with individual variables p, p(x), p(x, y), . . . . To keep terminology (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  48.  32
    Melvin Fitting, On Quantified Modal Logic.
    Propositional modal logic is a standard tool in many disciplines, but first-order modal logic is not. There are several reasons for this, including multiplicity of versions and inadequate syntax. In this paper we sketch a syntax and semantics for a natural, well-behaved version of first-order modal logic, and show it copes easily with several familiar difficulties. And we provide tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  49.  8
    Melvin Fitting, A Program to Compute G¨Odel-L¨Ob Fixpoints.
    odel-L¨ ob computability logic. In order to make things relatively self-contained, I sketch the essential ideas of GL, and discuss the significance of its fixpoint theorem. Then I give the algorithm embodied in the program in a little more detail. It should be emphasized that nothing new is presented here — all the theory and methodology are due to others. The main interest is, in a sense, psychological. The approach taken here has been declared in the literature, more than once, (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  50.  34
    Melvin Fitting, Modal Logics A Summary of the Well-Behaved.
    Modal logic is an enormous subject, and so any discussion of it must limit itself according to some set of principles. Modal logic is of interest to mathematicians, philosophers, linguists and computer scientists, for somewhat different reasons. Typically a philosopher may be interested in capturing some aspect of necessary truth, while a mathematician may be interested in characterizing a class of models having special structural features. For a computer scientist there is another criterion that is not as relevant for the (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
1 — 50 / 131