Fragments of bounded arithmetic and the lengths of proofs (Q5502825): Difference between revisions

@@ Property / DOI @@
-.2178/jsl/1230396927
@@ Property / DOI: 10.2178/jsl/1230396927 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2178/jsl/1230396927
+Normal rank
@@ Property / OpenAlex ID @@
+W2097024958
@@ Property / OpenAlex ID: W2097024958 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for proof-search and speed-up in the predicate calculus
+Normal rank
@@ Property / cites work @@
+Q4208265
@@ Property / cites work: Q4208265 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded arithmetic and the polynomial hierarchy
@@ Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Quantified propositional calculi and fragments of bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Herbrandizing search problems in Bounded Arithmetic
+Normal rank
@@ Property / cites work @@
+On induction-free provability
@@ Property / cites work: On induction-free provability / rank @@
+Normal rank
@@ Property / DOI @@
+.2178/JSL/1230396927
@@ Property / DOI: 10.2178/JSL/1230396927 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5502825