Recognizability, hypergraph operations, and logical types

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

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

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

منابع مشابه

Recognizability, hypergraph operations, and logical types

We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra on relational structures is based on disjoint union and quantifier-free definable operations. We expand it to an equivalent one by adding opera...

متن کامل

Quantifier-free definable graph operations preserving recognizability

We show that an operation on graphs, and more generally, on relational structures that has an inverse definable by a monadic secondorder transduction preserves the family of recognizable sets.

متن کامل

Logical types and linguistic types

One of the primary aims of linguistic semantics is to translate the expressions of natural language into formulas of some logical calculus. These formulas, in turn, can be interpreted in the appropriate models, and semantic notions like truth, entailment, etc. can be formally defined in the usual manner. In addition to the well-known theoretical advantages of such an intermediate logical form, ...

متن کامل

Logical Operations and Invariance

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the not...

متن کامل

Grammar and Logical Types

This paper represents categorial grammar as an implicational type theory in the spirit of Girard's linear logic, and illustrates linguistic applications of a range of type-constructors over and above implication. The type theoretic perspective is concerned with a correspondence between the logic of types, and computational operations over the objects inhabiting types. In linguistic applications...

متن کامل

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


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

ژورنال

عنوان ژورنال: Information and Computation

سال: 2006

ISSN: 0890-5401

DOI: 10.1016/j.ic.2005.11.006