Approximate formulae for a logic that capture classes of computational complexity

Logic Journal of the IGPL 17 (1):131-154 (2008)
  Copy   BIBTEX

Abstract

This paper presents a syntax of approximate formulae suited for the logic with counting quantifiers

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

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

Approximate Counting in Bounded Arithmetic.Emil Jeřábek - 2007 - Journal of Symbolic Logic 72 (3):959 - 993.
On the Capture of Complexity Classes Using Logic.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
Spectra of formulae with Henkin quantifiers.Joanna Golinska-Pilarek & Konrad Zdanowski - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 29-45.
Justifying induction on modal -formulae.L. Alberucci, J. Krahenbuhl & T. Studer - 2014 - Logic Journal of the IGPL 22 (6):805-817.
An approximate approach to belief revision.Shangmin Luan, Guozhong Dai & Lorenzo Magnani - 2012 - Logic Journal of the IGPL 20 (2):486-496.
Complexity of the two-variable fragment with counting quantifiers.Ian Pratt-Hartmann - 2005 - Journal of Logic, Language and Information 14 (3):369-395.
Representability in Default Logic.Paolo Liberatore - 2005 - Logic Journal of the IGPL 13 (3):335-351.

Analytics

Added to PP
2015-02-04

Downloads
2 (#1,450,151)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references