A feasible theory of truth over combinatory algebra (Q2637706): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2013.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073850897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical frameworks for truth and abstraction. An axiomatic study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4981445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AXIOMS FOR DETERMINATENESS AND TRUTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unfolding of non-finitist arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNFOLDING FINITIST ARITHMETIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic approach to self-referential truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The provably terminating operations of the subsystem PETJ of explicit mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary explicit types and polynomial time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realisability in weak systems of explicit mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories with self-application and computational complexity. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 7 July 2024

scientific article
Language Label Description Also known as
English
A feasible theory of truth over combinatory algebra
scientific article

    Statements

    A feasible theory of truth over combinatory algebra (English)
    0 references
    0 references
    14 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polytime computability
    0 references
    applicative theories
    0 references
    truth theories
    0 references
    0 references