Henkin quantifiers and complete problems
dc.contributor.author | Blass, Andreas | en_US |
dc.contributor.author | Gurevich, Yuri | en_US |
dc.date.accessioned | 2006-04-07T19:36:09Z | |
dc.date.available | 2006-04-07T19:36:09Z | |
dc.date.issued | 1986 | en_US |
dc.identifier.citation | Blass, Andreas, Gurevich, Yuri (1986)."Henkin quantifiers and complete problems." Annals of Pure and Applied Logic 32(): 1-16. <http://hdl.handle.net/2027.42/26312> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6TYB-48HRXG0-2/2/d869d3939b219d96073232ceaf4679a0 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/26312 | |
dc.description.abstract | We analyze computational aspects of partially ordered quantification in first-order logic. Show that almost any non-linear quantifier, applied to quantifier-free first-order formula suffices to express an -complete predicate. The remaining non-linear quantifiers experiment exactly co- predicates. | en_US |
dc.format.extent | 1120664 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Henkin quantifiers and complete problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Mathematics Department and Electrical Engineering and Computer Science Department, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationum | Mathematics Department and Electrical Engineering and Computer Science Department, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/26312/1/0000397.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0168-0072(86)90040-0 | en_US |
dc.identifier.source | Annals of Pure and Applied Logic | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.