Partially ordered connectives and finite graphs

&
In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 79--88 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
Partially ordered connectives and monadic monotone strict np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.
If-logic and truth-definition.Gabriel Sandu - 1998 - Journal of Philosophical Logic 27 (2):143-164.
Decidability and ℵ0-categoricity of theories of partially ordered sets.James H. Schmerl - 1980 - Journal of Symbolic Logic 45 (3):585 - 611.
Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
The Superintuitionistic Predicate Logic of Finite Kripke Frames Is Not Recursively Axiomatizable.Dmitrij Skvortsov - 2005 - Journal of Symbolic Logic 70 (2):451 - 459.
A quantum theory of space and time.Geoffrey Hemion - 1980 - Foundations of Physics 10 (11-12):819-840.
From a connected, partially ordered set of events to a partially ordered field of time intervals.P. G. Vroegindewey, V. Ja Kreinovič & O. M. Kosheleva - 1980 - Foundations of Physics 10 (5-6):469-484.
On the expressiveness of frame satisfiability and fragments of second-order logic.Thomas Eiter & Georg Gottlob - 1998 - Journal of Symbolic Logic 63 (1):73-82.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.

Analytics

Added to PP
2014-01-31

Downloads
15 (#940,347)

6 months
5 (#627,481)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gabriel Sandu
University of Helsinki

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
If-logic and truth-definition.Gabriel Sandu - 1998 - Journal of Philosophical Logic 27 (2):143-164.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
Partially ordered connectives and monadic monotone strict np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.

Add more citations

References found in this work

No references found.

Add more references