Term-generic logic

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

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

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

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

منابع مشابه

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...

متن کامل

GFOL: A Term-Generic Logic for De ning λ-Calculi

Generic rst-order logic (GFOL) is 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. GFOL has a complete Gentzen system generalizing that of FOL. An important fragment of GFOL, called HORN, possesses a much simpler Gentzen system, simil...

متن کامل

Lissencephaly, generic term

Key-words Definition/Classification Etiology Classic lissencephalies Lissencephaly variants Cobblestone lissencephalies Bibliography

متن کامل

A Logic for Reasoning about Generic Judgments

This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆∇ of Miller and Tiu, with an induction principle. The logic FOλ∆∇ is itself an extension of intuitionistic logic with fixed points and a “generic quantifier”, ∇, which is used to reason about the dynamics of bindings in object systems encoded in the logic. A previous attempt to extend FOλ∆∇ with an ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2015

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2015.01.047