Realisability in weak systems of explicit mathematics (Q3107339): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/malq.201020064
+Normal rank
@@ Property / OpenAlex ID @@
+W2163590111
@@ Property / OpenAlex ID: W2163590111 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679172
@@ Property / cites work: Q3679172 / rank @@
+Normal rank
@@ Property / cites work @@
+Polytime, combinatory logic and positive safe induction
+Normal rank
@@ Property / cites work @@
+Q5702663
@@ Property / cites work: Q5702663 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4141228
@@ Property / cites work: Q4141228 / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
+Normal rank
@@ Property / cites work @@
+The provably terminating operations of the subsystem PETJ of explicit mathematics
+Normal rank
@@ Property / cites work @@
+Elementary explicit types and polynomial time operations
+Normal rank
@@ Property / cites work @@
+Theories with self-application and computational complexity.
+Normal rank
@@ Property / cites work @@
+A proof-theoretic characterization of the basic feasible functionals
+Normal rank
@@ Property / cites work @@
+Q3081651
@@ Property / cites work: Q3081651 / rank @@
+Normal rank