SUSZKO’S PROBLEM: MIXED CONSEQUENCE AND COMPOSITIONALITY

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Suszko's Problem: Mixed Consequence and Compositionality

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a ...

متن کامل

Wilfrid Hodges COMPOSITIONALITY IS NOT THE PROBLEM

The paper analyses what is said and what is presupposed by the Principle of Compositionality for semantics, as it is commonly stated. The Principle of Compositionality is an axiom which some semantics satisfy and some don’t. It says essentially that if two expressions have the same meaning then they make the same contribution to the meanings of expressions containing them. This is a sensible ax...

متن کامل

Compositionality Criteria for Defining Mixed-Styles Synchronous Languages

This is not a paper about compositionality in itself, nor a general paper about mixing synchronous languages. We rst recall that compositionality appears in three places in the deenition of synchronous languages : 1) the synchrony hypothesis guarantees that the formal semantics of the language is compositional (in the sense that there exists an appropriate congruence) ; 2) programming environme...

متن کامل

Tolerance and Mixed Consequence in the S'valuationist Setting

In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a t...

متن کامل

How to Solve the Problem of Compositionality by Oscillatory Networks

Cognitive systems are regarded to be compositional: The semantic values of complex representations are determined by, and dependent on, the semantic values of primitive representations. Both classical and connectionist networks fail to model compositionality in a plausible way. The paper introduces oscillatory networks as a third alternative. It provides neurobiological evidence for the adequac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Review of Symbolic Logic

سال: 2019

ISSN: 1755-0203,1755-0211

DOI: 10.1017/s1755020318000503