Dependence logic with generalized quantifiers: axiomatizations
From MaRDI portal
Publication:2361348
DOI10.1016/j.jcss.2017.03.010zbMath1423.03110OpenAlexW2604996938MaRDI QIDQ2361348
Jouko Väänänen, Juha Kontinen, Fredrik Engström
Publication date: 30 June 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/214806
Related Items (3)
COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ Unnamed Item ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatizing first-order consequences in dependence logic
- On definability in dependence logic
- Some applications of Henkin quantifiers
- On branching quantifiers in English
- Definability of polyadic lifts of generalized quantifiers
- Generalized quantifiers and pebble games on finite structures
- Generalized quantifiers in dependence logic
- On a generalization of quantifiers
- Languages that Capture Complexity Classes
- Some model theory for monotone quantifiers
- Compositional semantics for a language of imperfect information
- Characterizing quantifier extensions of dependence logic
- Logic with the quantifier “there exist uncountably many”
This page was built for publication: Dependence logic with generalized quantifiers: axiomatizations