Polynomial time ultrapowers and the consistency of circuit lower bounds

A polynomial time ultrapower is a structure given by the set of polynomial time computable functions modulo some ultrafilter. They model the universal theory ∀ PV of all polynomial time functions. Generalizing a theorem of Hirschfeld (Israel J Math 20(2):111–126, 1975 ), we show that every countable...

Full description

Saved in:

Bibliographic Details
Published in:	Archive for mathematical logic Vol. 59; no. 1-2; pp. 127 - 147
Main Authors:	Bydžovský, Jan, Müller, Moritz
Format:	Journal Article Publication
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2020 Springer Nature B.V
Subjects:	Algebra Circuits Informàtica Informàtica teòrica Lower bounds Mathematical analysis Mathematical Logic and Foundations Mathematics Mathematics and Statistics Original Study Polinomis Polynomials Production scheduling Substructures Time functions Àrees temàtiques de la UPC 03C20 03C98 03B70 Bounded arithmetic 68Q17 Circuit lower bounds Restricted ultrapowers
ISSN:	0933-5846, 1432-0665
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!