OQa72sxBjkqqwDL08FGg8kcDYnZk1WAeNTjjZtjQJGa4gvVrUeI6129gd4dI
Current position: Home >> Scientific Research >> Paper Publications

The countable versus uncountable branching recurrences in computability logic

Hits:

Title of Paper:The countable versus uncountable branching recurrences in computability logic

Journal:Journal of Applied Logic,2012

Indexed by:Journal paper

Document Code:SCI (000312521800011)

Discipline:Natural Science

First-Level Discipline:Mathematics

Document Type:J

Volume:10

Issue:4

Page Number:431-446

Translation or Not:No

Included Journals:SCI

Date:2018-08-16

Prev One:A propositional system induced by Japaridze’s approach to IF logic

Next One:The parallel versus branching recurrences in computability logic