Epistemic semantics for classical and intuitionistic logic

  title={Epistemic semantics for classical and intuitionistic logic},
  author={John Neil Martin},
  journal={Notre Dame J. Formal Log.},
  • J. Martin
  • Published 1 April 1984
  • Mathematics, Computer Science
  • Notre Dame J. Formal Log.
On se propose d'expliquer comment plusieurs systemes semantiques nonstandards pour la logique propositionnelle peuvent etre consideres comme employant essentiellement les memes principes pour definir la notion de subtitution logique et l'idee plus fondamentale d'affectation de vraies valeurs aux phases moleculaires 
A nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals
  • H. Rott
  • Philosophy
    The Logic of Theory Change
  • 1989
Using Gardenfors's notion of epistemic entrenchment, the semantics of a logic is developed which explains the nonmonotonic nature of the consequence relation governing languages which contain conditionals, and how to deduce conditionals from premise sets without conditionals.
Condit ional Logic for Bel ief Revis ion Part 1 : Semantics and Logic of Simple Condit ionals
Using G£rdenfors's notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer If -~A then B if all we know
Emergence, a Universal Phenomenon which Connects Reality to Consciousness, Natural Sciences to Humanities
Abstract Progress in neuroscience has left a central question of psychism unanswered: what is consciousness? Modeling the psyche from a computational perspective has helped to develop cognitive
Mathematical models in neuroscience
Considering that any biological structure can be assimilated to a fractal (both structurally and functionally), a mathematicalphysical model is proposed in order to explain the mirror neurons paradigm, in which the specific neuronal network and specific logics appear.


Semantical Analysis of Intuitionistic Logic I
Formal semantics and logic
The Bivalence Birkhoff-Birkhoff Algorithm simplifies Euclidean reversing Alphabetic variant Alphabetical order and proves the existence of a new type of Boolean algebra called Bound variable Branch.
Formal Semantics and Logic. By Bas C. van Fraassen. New York: The Macmillan Company; Toronto: Collier-Macmillan Canada, Ltd., 1971. Pp. xiv, 225. $9.95.
pause: "Formally, each object is merely a locus in a web of relations, i.e. in the relational form in which objects can stand; and the relational form must be so fixed, must be formally
Classical indeterminacy, many-valued logic, and supervaluations
A solution to the problem of representing 3-valued supervaluational languages by 2-dimensional product languages is presented here that attempts to incorporate into such a representation familiar and plausible intuitive principles from traditional many-valued theories.
Logic and Sortal Incorrectness
The foundations of mathematics : a study in the philosophy of science
Canonical superlanguages