Sciweavers

Share
APAL
1999
68views more  APAL 1999»
8 years 12 months ago
Toward Categoricity for Classes with no Maximal Models
We provide here the first steps toward a Classification Theory of Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categori...
Saharon Shelah, Andrés Villaveces
APAL
1999
90views more  APAL 1999»
8 years 12 months ago
On Distinguishing Quotients of Symmetric Groups
A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [10]. Apart from the trivial and alternating subgroups, the normal subgroup...
Saharon Shelah, J. K. Truss
APAL
1999
97views more  APAL 1999»
8 years 12 months ago
Coalgebraic Logic
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...
Lawrence S. Moss
APAL
1999
55views more  APAL 1999»
8 years 12 months ago
Logic Programs, Well-Orderings, and Forward Chaining
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
APAL
1999
72views more  APAL 1999»
8 years 12 months ago
Lattices of Modal Logics and Their Groups of Automorphisms
The present paper investigates the groups of automorphisms for some lattices of modal logics. The main results are the following. The lattice of normal extensions of S4.3, NExt S4....
Marcus Kracht
APAL
1999
70views more  APAL 1999»
8 years 12 months ago
A Geometric Consequence of Residual Smallness
We describe a new way to construct large subdirectly irreducibles within an equational class of algebras. We use this construction to show that there are forbidden geometries of m...
Keith A. Kearnes, Emil W. Kiss, Matthew Valeriote
APAL
1999
74views more  APAL 1999»
8 years 12 months ago
Dynamic Linear Time Temporal Logic
Jesper G. Henriksen, P. S. Thiagarajan
APAL
1999
88views more  APAL 1999»
8 years 12 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting
APAL
1999
120views more  APAL 1999»
8 years 12 months ago
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
Samuel R. Buss
books