Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence 174 (16-17):1285-1306 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Means-end relations and a measure of efficacy.Jesse Hughes, Albert Esterline & Bahram Kimiaghalam - 2006 - Journal of Logic, Language and Information 15 (1-2):83-108.
Continuous propositional modal logic.Stefano Baratella - 2018 - Journal of Applied Non-Classical Logics 28 (4):297-312.
PDL with negation of atomic programs.Carsten Lutz & Dirk Walther - 2005 - Journal of Applied Non-Classical Logics 15 (2):189-213.
Safe beliefs for propositional theories.Mauricio Osorio, Juan Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
Two notions of compactness in Gödel logics.Petr Cintula - 2005 - Studia Logica 81 (1):99-123.
Semantique de type Kripke d'un systeme logique base sur un ensemble fini.A. Nour - 2000 - Mathematical Logic Quarterly 46 (3):417-432.
Completeness and Decidability of General First-Order Logic.Aldo Antonelli - 2017 - Journal of Philosophical Logic 46 (3):233-257.
Two Variable First-Order Logic Over Ordered Domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,380,763)

6 months
1 (#1,463,894)

Historical graph of downloads
How can I increase my downloads?