Term Logic

نویسندگان

چکیده

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

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

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

منابع مشابه

Dynamic Term-Modal Logic

A first-order dynamic epistemic logic is developed where the names of the agents are also terms in the sense of first-order logic. Consequently one can quantify over epistemic modalities. Using constructs from dynamic logic one can express many interesting concepts. First-order update models are developed and added to the language as modalities.

متن کامل

Term Sequent Logic

We consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to establish their properties. We prove a cut-eliminatio...

متن کامل

Term-Generic Logic

Term-generic logic (TGL) is a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring them to only provide generic notions of free variable and substitution satisfying reasonable properties. TGL has a complete Gentzen system generalizing that of first-order logic. A certain fragment of TGL, called Horn, possesses a much simpler Gentzen system,...

متن کامل

Term-Generic First-Order Logic

Term-generic rst-order logic, or simply generic rst-order logic (GFOL), is presented as a rst-order logic parameterized with terms de ned axiomatically (rather than constructively), by requiring them to only provide generic notions of free variable and substitution satisfying reasonable properties. A complete Gentzen deduction system is given, as well as complete equational and many-sorted exte...

متن کامل

Term-modal logic and quantifier-free dynamic assignment logic

Thalmann, Lars 2000: Term-Modal Logic and Quantifier-free Dynamic Assignment Logic. Uppsala Theses in Computing Science 34. 140 pp. Uppsala. ISSN 0283–359X, ISBN 91–506–1443–6. In this dissertation, we present two new sorts of computer science logics. Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterm...

متن کامل

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


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

ژورنال

عنوان ژورنال: Axioms

سال: 2020

ISSN: 2075-1680

DOI: 10.3390/axioms9010018