scientific article
From MaRDI portal
Publication:3140634
zbMath0799.03065MaRDI QIDQ3140634
Gaisi Takeuti, Jan Krajíček, Samuel R. Buss
Publication date: 2 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
definable functionsconservation resultsprovably total functionsfragments of bounded arithmeticwitnessing theorems
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)
Related Items (6)
Witnesses for Answer Sets of Logic Programs ⋮ On parallel hierarchies and \(R_k^i\) ⋮ On parallel hierarchies and R ki ⋮ Mining the surface: witnessing the low complexity theorems of arithmetic ⋮ Determining inference semantics for disjunctive logic programs ⋮ Omission-Based Abstraction for Answer Set Programs
This page was built for publication:
