A normal form for arithmetical representation of N P-sets
From MaRDI portal
Publication:790804
DOI10.1016/0022-0000(83)90048-XzbMATH Open0535.03016MaRDI QIDQ790804FDOQ790804
Authors: Bernard Hodgson, Clement F. Kent 
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
- A remark on arithmetic equivalence and the normset
- A normal form for arithmetical derivations implying the \(\omega\)-consistency of arithmetic
- Representing hyper-arithmetical sets by equations over sets of integers
- Normal Forms for Characteristic Functions on n-ary Relations
- Prenex normal form theorems in semi-classical arithmetic
- scientific article
- On \(n\)-normal posets
- Arithmetic progressions in the solution sets of norm form equations
- Normal forms for representations of representation-finite algebras
- scientific article; zbMATH DE number 2124085
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- NP-complete decision problems for binary quadratics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hilbert's Tenth Problem is Unsolvable
- Arithmetical problems and recursively enumerable predicates
- Complete sets and the polynomial-time hierarchy
- An arithmetical characterization of NP
- Title not available (Why is that?)
- Arithmetical representation of recursively enumerable sets
- A new proof of the theorem on exponential diophantine representation of enumerable sets
- Title not available (Why is that?)
Cited In (7)
This page was built for publication: A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790804)
