A second order theory of ordinal numbers with Ackermann-type reflection schema

نویسندگان

چکیده

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

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

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

منابع مشابه

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

15 صفحه اول

Efficient Second-Order Predicate Schema Matching Algorithm

A schema is an abstracted or a generalized knowledge to help with solving problems. A second-order predicate schema matching is a problem of computing the matchers of a pair 〈P, p〉 such that P is a second-order predicate schema and p is a first order closed formula. The second-order matching is known as NP-complete,in general. We propose a new matching algorithm based on the pre-checking of the...

متن کامل

Extending models of second order predicate logic to models of second order dependent type theory

We describe a method for constructing a model of second order dependent type theory out of a model of classical second order predicate logic. Apart from the construction being of interest by itself, this also suggests a way of proving the completeness of the formulas-as-types embedding from second order predicate logic to second order dependent type theory. Under this embedding, formulas are in...

متن کامل

Second-order Linear Recurrences of Composite Numbers

In a well-known result, Ronald Graham found a Fibonacci-like sequence whose two initial terms are relatively prime and which consists only of composite integers. We generalize this result to nondegenerate second-order recurrences.

متن کامل

Sequences of Ordinal Numbers

In the first part of the article we introduce the following operations: On X that yields the set of all ordinals which belong to the set X, Lim X that yields the set of all limit ordinals which belong to X, and inf X and sup X that yield the minimal ordinal belonging to X and the minimal ordinal greater than all ordinals belonging to X, respectively. The second part of the article starts with s...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1977

ISSN: 0025-5645

DOI: 10.2969/jmsj/02940745