Polylogarithmic Cuts in Models of V^0

DOI10.2168/LMCS-9(1:16)2013zbMath1280.03056arXiv1303.6075MaRDI QIDQ4913779

Sebastian Müller

Publication date: 9 April 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.6075

zbMATH Keywords

bounded arithmeticproof complexitycutsmodels of bounded arithmeticsimulations of proof systemstwo-sorted theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Complexity of proofs (03F20)

Related Items (1)

Iterated multiplication in \(VTC^0\)

This page was built for publication: Polylogarithmic Cuts in Models of V^0