scientific article; zbMATH DE number 1163935
From MaRDI portal
Publication:4395559
Recommendations
- scientific article; zbMATH DE number 4053589
- Henkin and function quantifiers
- scientific article; zbMATH DE number 2149377
- scientific article; zbMATH DE number 1749204
- Henkin quantifiers and Boolean formulae
- Polyadic quantifiers
- Henkin quantifiers and complete problems
- Quantifiers and partiality
- scientific article; zbMATH DE number 1064109
- Henkin quantifiers and the definability of truth
Cited in
(17)- Partially ordered connectives and monadic monotone strict NP
- Henkin and function quantifiers
- IF-logic and truth-definition
- Succinctness as a source of complexity in logical formalisms
- Degrees of logics with Henkin quantifiers in poor vocabularies
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
- Relative computability and uniform continuity of relations
- Explicit Henkin sentences
- scientific article; zbMATH DE number 4053589 (Why is no real title available?)
- scientific article; zbMATH DE number 22239 (Why is no real title available?)
- scientific article; zbMATH DE number 25881 (Why is no real title available?)
- scientific article; zbMATH DE number 2149377 (Why is no real title available?)
- Henkin quantifiers and the definability of truth
- Truth and definite truth
- Computational complexity of the semantics of some natural language constructions
- Alternating (in)dependence-friendly logic
- Bounded Henkin quantifiers and the exponential time hierarchy
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395559)
