A Lindström-style theorem for finitary propositional weak entailment languages with absurdity.
Guillermo BadiaPublished in: Log. J. IGPL (2016)
Keyphrases
- probabilistic logic
- first order logic
- expressive power
- language independent
- polynomial hierarchy
- finite state
- propositional variables
- propositional logic
- belief base
- logic programming
- np complete
- language identification
- text summarization
- default logic
- cross lingual
- markov decision processes
- query translation
- von neumann
- autoepistemic logic
- query language