Results 1  10
of
385
SUPERVALUATION FIXEDPOINT LOGICS OF TRUTH
"... Abstract. Michael Kremer defines fixedpoint logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixedpoint logic of truth and the weak Kleene fixedpoint logic of truth, but leaves the axiomatizability ..."
Abstract
 Add to MetaCart
of ‘fixed point’, and by variant supervaluation schemes. A ‘logic ’ is often thought of, not as a consequence relation, but as a set of sentences–the sentences true on each interpretation. We axiomatize the supervaluation fixedpoint logics so conceived. §1. Introduction. One reaction to the liar paradox
/ Lukasiewicz, Supervaluations, And The Future
, 1996
"... In this paper I consider an interpretation of future contingents which motivates a unification of a / Lukiasiewiczstyle logic, and the more classical, supervaluational semantics. This in turn motivates a new nonclassical logic modelling what is "made true by history up until now". I give ..."
Abstract
 Add to MetaCart
In this paper I consider an interpretation of future contingents which motivates a unification of a / Lukiasiewiczstyle logic, and the more classical, supervaluational semantics. This in turn motivates a new nonclassical logic modelling what is "made true by history up until now". I
/ Lukasiewicz, Supervaluations, And The Future
, 1996
"... In this paper I consider an interpretation of future contingents which motivates a unification of a / Lukiasiewiczstyle logic, and the more classical, supervaluational semantics. This in turn motivates a new nonclassical logic modelling what is "made true by history up until now". I give ..."
Abstract
 Add to MetaCart
In this paper I consider an interpretation of future contingents which motivates a unification of a / Lukiasiewiczstyle logic, and the more classical, supervaluational semantics. This in turn motivates a new nonclassical logic modelling what is "made true by history up until now". I
SOME SUPERVALUATIONBASED CONSEQUENCE RELATIONS
, 2002
"... In this paper, we define some consequence relations based on supervaluation semantics for partial models, and we investigate their properties. For our main consequence relation, we show that natural versions of the following fail: upwards and downwards Lowenheim–Skolem, axiomatizability, and compac ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we define some consequence relations based on supervaluation semantics for partial models, and we investigate their properties. For our main consequence relation, we show that natural versions of the following fail: upwards and downwards Lowenheim–Skolem, axiomatizability
PHILIP KREMER AND ALASDAIR URQUHART SUPERVALUATION FIXEDPOINT LOGICS OF TRUTH
"... ABSTRACT. Michael Kremer defines fixedpoint logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixedpoint logic of truth and the weak Kleene fixedpoint logic of truth, but leaves the axiomatizability ..."
Abstract
 Add to MetaCart
of ‘fixed point’, and by variant supervaluation schemes. A ‘logic ’ is often thought of, not as a consequence relation, but as a set of sentences – the sentences true on each interpretation. We axiomatize the supervaluation fixedpoint logics so conceived. KEY WORDS: fixed point logics, languages, truth 1.
Combining supervaluation and degree based reasoning under vagueness
"... Abstract. Two popular approaches to formalize adequate reasoning with vague propositions are usually deemed incompatible: On the one hand, there is supervaluation with respect to precisification spaces, which consist in collections of classical interpretations that represent admissible ways of makin ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. Two popular approaches to formalize adequate reasoning with vague propositions are usually deemed incompatible: On the one hand, there is supervaluation with respect to precisification spaces, which consist in collections of classical interpretations that represent admissible ways
REVISITING GILES’S GAME Reconciling Fuzzy Logic and Supervaluation ∗
"... We explain Giles’s characterization of ̷Lukasiewicz logic via a dialogue game combined with bets on results of experiments that may show dispersion. The game is generalized to other fuzzy logics and linked to recent results in proof theory. We argue that these results allow one to place tnorm based ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
norm based fuzzy logics in a common framework with supervaluation as a theory of vagueness.
SELECTION AND INFORMATION: A CLASSBASED APPROACH TO LEXICAL RELATIONSHIPS
, 1993
"... Selectional constraints are limitations on the applicability of predicates to arguments. For example, the statement “The number two is blue” may be syntactically well formed, but at some level it is anomalous — BLUE is not a predicate that can be applied to numbers. According to the influential theo ..."
Abstract

Cited by 269 (9 self)
 Add to MetaCart
Selectional constraints are limitations on the applicability of predicates to arguments. For example, the statement “The number two is blue” may be syntactically well formed, but at some level it is anomalous — BLUE is not a predicate that can be applied to numbers. According to the influential theory of (Katz and Fodor, 1964), a predicate associates a set of defining features with each argument, expressed within a restricted semantic vocabulary. Despite the persistence of this theory, however, there is widespread agreement about its empirical shortcomings (McCawley, 1968; Fodor, 1977). As an alternative, some critics of the KatzFodor theory (e.g. (JohnsonLaird, 1983)) have abandoned the treatment of selectional constraints as semantic, instead treating them as indistinguishable from inferences made on the basis of factual knowledge. This provides a better match for the empirical phenomena, but it opens up a different problem: if selectional constraints are the same as inferences in general, then accounting for them will require a much more complete understanding of knowledge representation and inference than we have at present. The problem, then, is this: how can a theory of selectional constraints be elaborated without first having either an empirically adequate theory of defining features or a comprehensive theory of inference? In this dissertation, I suggest that an answer to this question lies in the representation of conceptual
On GuptaBelnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set.
 in Bulletin of Symbolic Logic, 7, No.3
, 2001
"... . We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified (in terms of definitional complexit ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
complexity) account of varied revision sequences  as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes. x1.
Results 1  10
of
385