A new face of the branching recurrence of computability logic
نویسنده
چکیده
This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic, and proves its equivalence to the old, “canonical” version. MSC: primary: 03B47; secondary: 03B70; 68Q10.
منابع مشابه
The countable versus uncountable branching recurrences in computability logic
This paper introduces a new simplified version of the countable branching recurrence ◦ |א0 of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by ◦ |א0 (i.e., the one in the signature {¬,∧,∨, ◦ |א0 , ◦| א}) is a proper superset of the basic logic induced by the uncountable branching recurrence ◦ | (i.e., the one in the signature {¬,∧,∨, ◦ | , ◦|...
متن کاملMathematical Logic The taming of recurrences in computability logic through cirquent calculus, Part II
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦| , and branching corecurrence ◦| . The article is published in two parts, with (the previous) Part I containing prelimin...
متن کاملMathematical Logic The taming of recurrences in computability logic through cirquent calculus, Part I
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦| , and branching corecurrence ◦| . The article is published in two parts, with (the present) Part I containing prelimina...
متن کاملThe parallel versus branching recurrences in computability logic
This paper shows that the basic logic induced by the parallel recurrence ∧ | of Computability Logic (i.e., the one in the signature {¬,∧,∨,∧ | ,| }) is a proper superset of the basic logic induced by the branching recurrence ◦ | (i.e., the one in the signature {¬,∧,∨, ◦ | , ◦| }). The latter is known to be precisely captured by the cirquent calculus system CL15, conjectured by Japaridze to rema...
متن کاملSeparating the basic logics of the basic recurrences
This paper shows that, even at the most basic level (namely, in combination with only ¬,∧,∨), the parallel, countable branching and uncountable branching recurrences of computability logic validate different principles. MSC: primary: 03B47; secondary: 03B70; 68Q10; 68T27; 68T15.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 25 شماره
صفحات -
تاریخ انتشار 2012