Online Store

Geometry.Net - the online learning center
Home  - Mathematical_Logic - Finite Structures
Page 1     1-48 of 48    1 

1. Cherlin, G. And Hrushovski, E.: Finite Structures With Few Types. (AM-152).
of the book Finite structures with Few Types. (AM152) by Cherlin, G. and Hrushovski, E., published by Princeton University Press.......
Book Search: Keywords Author Title or ISBN More Options Power Search Search Hints
Google contents of this website:
Google full text of our books:
Finite Structures with Few Types. (AM-152)
Shopping Cart
Chapter 1 [in PDF format]
Google full text of this book:
This book applies model theoretic methods to the study of certain finite permutation groups, the automorphism groups of structures for a fixed finite language with a bounded number of orbits on 4-tuples. Primitive permutation groups of this type have been classified by Kantor, Liebeck, and Macpherson, using the classification of the finite simple groups. Building on this work, Gregory Cherlin and Ehud Hrushovski here treat the general case by developing analogs of the model theoretic methods of geometric stability theory. The work lies at the juncture of permutation group theory, model theory, classical geometries, and combinatorics. The principal results are finite theorems, an associated analysis of computational issues, and an "intrinsic" characterization of the permutation groups (or finite structures) under consideration. The main finiteness theorem shows that the structures under consideration fall naturally into finitely many families, with each family parametrized by finitely many numerical invariants (dimensions of associated coordinating geometries). The authors provide a case study in the extension of methods of stable model theory to a nonstable context, related to work on Shelah's "simple theories." They also generalize Lachlan's results on stable homogeneous structures for finite relational languages, solving problems of effectivity left open by that case. Their methods involve the analysis of groups interpretable in these structures, an analog of Zilber's envelopes, and the combinatorics of the underlying geometries. Taking geometric stability theory into new territory, this book is for mathematicians interested in model theory and group theory.

2. Atlas: Dedekind-finite Structures By Agatha Walczak-Typke
DedekindFinite structures by Agatha Walczak-Typke We discuss recent results concerning the algebraic structures whose domains are Dedekind Finite sets.
Atlas home Conferences Abstracts about Atlas Joint Meeting of AMS, DMV, and ÖMG
June 16-19, 2005
Johannes Gutenberg University
Mainz, Germany Organizers
Volker Bach, Mainz; Klaus D. Bierstedt, DMV; Susan Friedlander, Associate Secretary, AMS View Abstracts
Conference Homepage
Dedekind-finite Structures
Agatha Walczak-Typke
University of Leeds, UK A set is Dedekind finite if it has no countably infinite subsets. Infinite such sets are only relevant in set theory without the axiom of choice. We discuss recent results concerning the algebraic structures whose domains are Dedekind finite sets. Date received: March 25, 2005 Atlas Conferences Inc. Document # caql-69.

3. Implementing Finite Structures In Mathematica Via A Skeletal Topos Of Finite Set
Abstract To implement Finite structures in a symbolic computation program such as Mathematica, we consider a skeletal topos N which is equiva lent to the
Implementing finite structures in Mathematica via a skeletal topos of finite sets
Susan B. Niefield
Organization: Union College Department: Mathematics URL: Journal / Anthology
Journal of Symbolic Computation Year: Volume: Page range: Description
Abstract To implement finite structures in a symbolic computation program such as Mathematica Mathematica ) is obtained by transporting the topos structure of Setf along a suitable pseudo-inverse C of the functor from N to Set f described above. The code for the Mathematica implementation included below is also available as a Mathematica Notebook [6].
Foundations of Mathematics Set Theory
Sign up for our newsletter:

4. Finite Model Theory - Wikipedia, The Free Encyclopedia
Finite model theory is a subfield of model theory that focuses on properties of logical languages, such as firstorder logic, over Finite structures,
var wgNotice = ""; var wgNoticeLocal = ""; var wgNoticeLang = "en"; var wgNoticeProject = "wikipedia";
Finite model theory
From Wikipedia, the free encyclopedia
Jump to: navigation search Finite model theory is a subfield of model theory that focuses on properties of logical languages, such as first-order logic , over finite structures, such as finite groups graphs databases , and most abstract machines . It focuses in particular on connections between logical languages and computation, and is closely associated with discrete mathematics complexity theory , and database theory Many important results of first-order logic and classical model theory fail when restricted to finite structures, including the compactness theorem , the Craig interpolation lemma , the Los-Tarski preservation theorem , the Downward L¶wenheim-Skolem theorem , and G¶del's completeness theorem . The essential problem is that in this context, first-order logic is not sufficiently expressive. By extending first-order logic with operators such as transitive closure and least fixed point , and by using fragments of second-order logic, we obtain new logics that have more interesting properties over finite structures.

5. JSTOR Generalized Quantifiers And Pebble Games On Finite Structures.
Generalized quantifiers and pebble games on Finite structures. Annals of pure and applied logic, vol. 74 (1995) pp. 2375. The systematic study of the model<1387:GQAPGO>2.0.CO;2-G

6. RPGnet The Inside Scoop On Gaming
Finite structures are an essential element of game design. Finite structures also provide a model for the interactions inside RPGs. reviews/columns/physics29aug03.html

7. [math/0401095] Profinite Structures Are Retracts Of Ultraproducts Of Finite Stru
ProFinite structures are Retracts of Ultraproducts of Finite structures. Authors Hugo Luiz Mariano Subjclass Logic; Category Theory math
Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages
Full-text links: Download:
Citations p revious n ... ext
Mathematics > Logic
Title: Profinite Structures are Retracts of Ultraproducts of Finite Structures
Authors: Hugo Luiz Mariano (Submitted on 9 Jan 2004) Abstract: Subjects: Logic (math.LO) ; Category Theory (math.CT) MSC classes: Cite as: arXiv:math/0401095v1 [math.LO]
Submission history
From: Hugo Luiz Mariano [ view email
Fri, 9 Jan 2004 19:21:11 GMT (21kb)
Which authors of this paper are endorsers?
Link back to: arXiv form interface contact

8. Infinitary Logic And Inductive Definability Over Finite Structures
Infinitary Logic and Inductive Definability over Finite structures PSPACE respectively in the presence of an ordering relation over Finite structures.

what's this?
Technical Reports (CIS) Browse this Collection CIS Collections Search CIS Website ... Submit a Paper TITLE:
Infinitary Logic and Inductive Definability over Finite Structures AUTHOR(S):
Anuj Dawar,
University of Pennsylvania
Steven Lindell,
University of Pennsylvania ... University of Pennsylvania
DOCUMENT TYPE: Technical Report Download the Document (PDF format - 2.0 MB) - 27 November 1991
Tell a colleague
about it.
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-91-97. ABSTRACT:
The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial fixed point operator (FO + PFP) are known to capture the complexity classes P and PSPACE respectively in the presence of an ordering relation over finite structures. Recently, Abiteboul and Vianu [AV91b] investigated the relation of these two logics in the absence of an ordering, using a mchine model of generic computation. In particular, they showed that the two languages have equivalent expressive power if and only if P = PSPACE. These languages can also be seen as fragments of an infinitary logic where each formula has a bounded number of variables, L (see, for instance, [KV90]). We present a treatment of the results in [AV91b] from this point of view. In particular, we show that we can write a formula of FO + LFP and P from ordered structures to classes of structures where every element is definable. We also settle a conjecture mentioned in [AV91b] by showing that FO + LFP in properly contained in the polynomial time computable fragment of

9. Finite Conformal Hypergraph Covers And Gaifman Cliques In Finite
In terms of relational structures, we show that every Finite relational structure admits a guarded bisimilar cover by a Finite structure whose Gaifman
Log in RSS Title Author(s) Abstract Subject Keyword All Fields FullText more options
  • Home Browse Search ... next
    Finite conformal hypergraph covers and Gaifman cliques in finite structures
    Ian Hodkinson and Martin Otto Source: Bull. Symbolic Logic Volume 09, Issue 3 (2003), 387- 405.
    Primary Subjects: Secondary Subjects: Keywords: finite model theory; extension property for partial isomorphisms; guarded logics; finite model property Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text Links and Identifiers Permanent link to this document: Mathematical Reviews number (MathSciNet): Digital Object Identifier: doi:10.2178/bsl/1058448678

10. Uniform Definability On Finite Structures With Successor
We study inductive and secondorder definability on Finite structures with successor and relate these notions to complexity theory.

The distribution of vibration over Finite structures excited by a force is considered. To describe the vibration distribution, a quantity, called motion
var tcdacmd="dt";

12. Volume 31 "Descriptive Complexity And Finite Models", Immerman And Kolaitis, Eds
Finite model theory can be succinctly described as the study of logics on Finite structures. It is an area of research in the interface between mathematical
DIMACS Series in
Discrete Mathematics and Theoretical Computer Science
VOLUME Thirty One
TITLE: Descriptive Complexity and Finite Models: Proceedings of a DIMACS Workshop, January 14-17, 1996
EDITORS: Neil Immerman and Phokion G. Kolaitis
Published by the American Mathematical Society
Ordering Information
This volume may be obtained from the AMS or through bookstores in your area. To order through AMS contact the AMS Customer Services Department, P.O. Box 6248, Providence, Rhode Island 02940-6248 USA. For Visa, Mastercard, Discover, and American Express orders call 1-800-321-4AMS. You may also visit the AMS Bookstore and order directly from there. DIMACS does not distribute or sell these books.
This volume is dedicated
to the memory of our colleague and friend
Paris C. Kanellakis
Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research in the interface between mathematical logic and computer science that has been developing through a continuous interaction with computational complexity, database theory, and combinatorics. Three of the main focuses of research in finite model theory are
  • the expressive power of logics: studying what can and what cannot be expressed in various logics restricted to finite structures;

13. FIST - Finite Structures
Our institute has especially old traditions in research of Finite combinatorial structures. These research results and techniques are applied more and more

14. Finite And Algorithmic Model Theory, Durham, January 2006.
Themes The study of the modeltheoretic properties of Finite structures emerged initially as a branch of classical model theory. However, in the late 1980s
Workshop on Finite and Algorithmic Model Theory University of Durham, 9-13 January 2006. Satellite meeting of the Newton Institute Programme
Logic and Algorithms

Registration, ... About Durham
Supported by:
Newton Institute, Cambridge

Main organizer Iain Stewart (Durham). Scientific Committee: (Bell-Labs), Javier Esparza (Stuttgart), Bradd Hart (McMaster), Christian Michaux (Mons-Hainaut), Charles Steinhorn (Vassar), Katrin Tent (Bielefeld). Themes: The study of the model-theoretic properties of finite structures emerged initially as a branch of classical model theory. However, in the late 1980s research concerning logics on finite structures diverged from work in classical model theory. The consideration of finite structures became intimately related with, for example, computational and descriptive complexity, model checking, database theory, verification, etc., so much so that the boundaries between these subjects are often hard to distinguish.
Yet, during the last five years or so there have been indications of a re-convergence of classical model theory and logical, finite aspects of computer science. This has resulted both from the interest of computer scientists in new computing and specification models that make use of infinitary structures, and from the development of powerful model-theoretic techniques that can provide insight into finite structures. Although many common themes have emerged and begun to gain attention, there is significant potential for wider interaction.

15. Publications Finite Conformal Hypergraph Covers And Gaifman
EPPA is thus established for the class of Finite conformal structures, of any relational type. This also gives a simplified route to the known EPPA for the
2. Finite conformal covers can be used in a straightforward reduction from the clique guarded fragment CGF (and the loosely guarded fragment LGF) to the guarded fragment GF, which is adequate for finite satisfiability. This gives a new simple and direct proof of the finite model property (FMP) for CGF and LGF.

16. Document Server@UHasselt: Item 1942/3231
In constraint programming terminology, this corresponds to Boolean real polynomial constraint queries on Finite structures. The fact that quantifiers range
Document Server@UHasselt Nederlands Francais English Deutsch Search DSpace
Advanced Search
Home Browse Communities Titles Authors By Date Sign on to: My DSpace
(authorized users) Help About DSpace Document Server@UHasselt Research Groups ... Unsorted Publications
Title: First-order queries on finite structures over the reals Authors: Paredaens, J
Van Gucht, D
Issue Date: Publisher: SIAM PUBLICATIONS Citation: SIAM JOURNAL ON COMPUTING, 27(6). p. 1747-1763 Abstract: ISSN: Appears in Collections: Unsorted Publications Theoretical Computer Science Files in This Item: There are no files associated with this item. DSpace Software MIT and Hewlett-Packard Feedback

17. FIST
Finite structures. Marie Curie Host Fellowship for the Transfer of Knowledge. Rényi Institute has concluded contract negotiations with the European
Finite Structures
Marie Curie Host Fellowship for the Transfer of Knowledge
Rényi Institute has concluded contract negotiations with the European Community, the project started on September 1, 2004. Our main fields of research are:
  • Codes and Designs
  • Geometry and Linear Algebra in Graph Theory
  • Random and Extremal Structures
  • Groups and Combinatorics
If you are interested in a visiting position, please contact
We expect applications from experienced researchers of the above fields.
Employment conditions are those of Marie Curie Fellowships:
The minimum length of employment is 2 months. Allowances (living, mobility, travel) are paid according to Marie Curie rates. We will also organize conferences and workshops connected to these research topics.
Further details will be posted on this page as organization begins, if you are interested, please return regularly.
Researchers participating in transfer of knowledge activities
Year 1
  • Stefan Dodunekov
  • Tsonka Baicheva
  • William Jackson
  • Joel Spencer
  • Rudolf Ahlswede
  • Rossitza Dodunekova
  • Aart Blokhuis
  • Stephan Foldes
  • Péter Erdõs
  • Ervin Gyõri
Year 2
  • Dezsõ Miklós
  • Jaroslav Nesetril
  • Vera T. Sós

18. Finite Model Theory - Wikibooks, Collection Of Open-content Textbooks
FMT is a restriction of MT to Finite structures, such as Finite graphs or strings. Since many central theorems of MT do not hold when restricted to Finite
var wgNotice = ""; var wgNoticeLocal = ""; var wgNoticeLang = "en"; var wgNoticeProject = "wikibooks";
Finite Model Theory
From Wikibooks, the open-content textbooks collection
Jump to: navigation search Finite Model Theory (FMT) is a subarea of Model Theory (MT). MT is the branch of mathematical logic which deals with the relation between a formal language (syntax) and its interpretations (semantics). FMT is a restriction of MT to finite structures, such as finite graphs or strings. Since many central theorems of MT do not hold when restricted to finite structures, FMT is quite different from MT in methods and application areas. So FMT has become an "unusually effective" instrument in computer science, like in database theory, model checking or for gaining new perspectives on computational complexity. The three main areas of FMT are presented here: Expressive Power of Languages, Descriptive Complexity and Random Structures. But first the results fundamental for all areas are introduced on the level of first order languages.
has related information at Finite model theory
edit Basics

19. Dugald Macpherson's Homepage
We consider arbitrary (elementary) classes of Finite structures satisfying the conclusions of the Chatzidakisvan den Dries-Macintyre theorem.
H. Dugald Macpherson
E-mail address:
Research Group:
Pure Mathematics

Mathematical Logic
Research Interests
I work in infinite permutation group theory and model-theoretic algebra. Some recent research interests are listed below.
1. Omega-categorical structures
A first-order structure is omega-categorical if it is countably infinite, and isomorphic to any other countable structure which satisfies the same first-order sentences. Permutation groups are involved, via the Ryll-Nardzewski Theorem. This states that a countably infinite structure is omega-categorical if and only if its automorphism group has finitely many orbits on k-sets of every positive integer k. I have worked (and have continuing interest) on various topics involving omega-categoricity, such as: homogeneous relational structures; smoothly approximable structures; omega-categorical groups; the small index property, and other properties of the automorphism groups. In a recent paper with Simon Thomas, it is shown that a Polish group with a comeagre conjugacy class cannot be expressed non-trivially as a free product with amalgamation (many automorphism groups of omega-categorical structures satisfy the hypotheses).
2. Topics in permutation group theory

20. Logicomp Finite Model Theory Preliminaries (2) Anthony Widjaja
Whenever `cc M` be the set of all Finite structures, we shall omit mention of `cc M`. An important special case occurs when `k = 0`.
@import url(""); @import url(""); var BL_backlinkURL = "";var BL_blogId = "12932458";
Logic and Complexity
Saturday, May 28, 2005
Finite Model Theory: Preliminaries (2)
We now focus on a very important concept in finite model theory: `k`-ary queries. In fact, one goal of finite model theory is to establish a useful, if possible complete , criterion for determining expressibility (ie, definability) of a query in a logic (such as, first-order logic) on finite structures. For example, we may ask if the query connectivity for finite graphs, which asks whether a finite graph is connected, is expressible in first-order logic. The answer is 'no', though we won't prove this now. [Curious readers are referred to Libkin's Elements of Finite Model Theory or Fagin's excellent survey paper
We shall start by recalling the notion of homomorphisms and isomorphisms between structures. Given two `sigma`-structures `fr A` and `fr B`, a homomorphism tuple-preserving functions (here, think of a tuple as an `r`-ary vector prepended by an `r`-ary relation symbol, eg, `R(1,2,3)`). Now

21. Algebra I Logika
Citation W. Calvert, D. Cummins, J. F. Knight, S. Miller, Comparing Classes of Finite structures, Algebra Logika, 2004, 436, 666–701.

22. MGI - Publications: Eric Rosen
In particular, we are interested in analyzing the expressive power of this logic over the class of Finite structures. First, we establish the decidability
Mathematical Foundations of Computer Science
Prof. Dr. Erich Gr¤del
Eric Rosen
E. Rosen. Some aspects of model theory and finite structures Bulletin of Symbolic Logic , vol. 8(3), pp. 380 – 403, 2002.                                  BibTeX Abstract No abstract.
E. Rosen and J. Tyszkiewicz. Mathematical Logic Quarterly , vol. 46, pp. 435–52, 2000.                                  BibTeX Abstract
E. Gr¤del, M. Otto, and E. Rosen. Undecidability Results on Two-Variable Logics Archive for Mathematical Logic , vol. 38, pp. 213–354, 1999.                                  BibTeX Abstract It is a classical result of Mortimer's that L$^2$, first-order logic with two variables, is decidable for satisfiability. It is shown that going beyond L$^2$ by adding any one of the following leads to an undecidable logic: – very weak forms of recursion, viz. transitive closure operations, or (restricted) monadic fixed-point operations – weak access to cardinalities, through the H¤rtig (or equicardinality) quantifier, or

23. INI Programme LAA Conference - Finite And Algorithmic Model
The study of the modeltheoretic properties of Finite structures emerged initially as a branch of classical model theory. However, in the late 1980s
An Isaac Newton Institute Satellite Workshop - University of Durham
Finite and Algorithmic Model Theory
9 - 13 January 2006 Organiser Professor Iain Stewart ( Durham
Scientific Committee Bell-Labs ), Javier Esparza ( Stuttgart ), Bradd Hart ( McMaster ), Christian Michaux ( Mons-Hainaut ), Charles Steinhorn ( Vassar ), Katrin Tent ( Bielefeld in association with the Newton Institute programme entitled Logic and Algorithms
Theme of Conference:
The study of the model-theoretic properties of finite structures emerged initially as a branch of classical model theory. However, in the late 1980s research concerning logics on finite structures diverged from work in classical model theory. The consideration of finite structures became intimately related with, for example, computational and descriptive complexity, model checking, database theory, verification, etc., so much so that the boundaries between these subjects are often hard to distinguish. The methods employed in classical model theory (with its focus on infinite structures) and finite model theory also grew apart during this period. Probabilistic techniques, as well as machine simulations and reductions, play a prominent role in the study of finite structures, and stand in contrast to the geometric, algebraic, and analytic methods that pervade classical (infinite) model theory. Although both classical and finite model theory deal with restricted classes of structures, the conditions by which such classes are delimited also have been quite different. Finite model theory typically concentrates on classes for which particular computing formalisms, e.g., finite state automata or other restricted models of computation, can be used to normalize formulas, or for which decomposition methods from finite graph theory can be applied. In contrast, infinitary model theory usually places restrictions on combinatorial or geometric properties of the definable sets of a structure.

24. Atomic And Electronic Structure Of Solids - Cambridge University Press
Defects, NonCrystalline Solids and Finite structures 9. Defects I point defects; 10. Defects II line defects; 11. Defects III surfaces and interfaces;

25. Photonic Band Edge Effects In Finite Structures An...[Phys Rev E Stat Nonlin Sof
Using the concept of an effective medium, we derive coupled mode equations for nonlinear quadratic interactions in photonic band gap structures of Finite

26. British Logic Colloquium 2006 - Abstracts
Second Order Logic over Finite structures Report on a Research Programme Georg Gottlob (Oxford). This talk reports about the results achieved so far in
Mathematical Institute
University of Oxford
September 7-9, 2006
Invited Talks
Second Order Logic over Finite Structures Report on a Research Programme
Georg Gottlob (Oxford)
This talk reports about the results achieved so far in the context of a research programme in the intersection of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over diferent types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of existential second-order logic on graphs.
Fine's Canonicity Theorem and its Converse
Ian Hodkinson (Imperial College, London)
In a 1975 paper, Kit Fine proved that if L is the modal logic of an elementary class of Kripke frames, then L is canonical. This was generalised to various algebras by several authors, notably van Benthem and Goldblatt. It is a central result in canonicity. Fine asked in his paper whether the converse holds. I will try to show how probabilistic and model-theoretic methods contribute to resolving this problem. This is joint work with Rob Goldblatt (Wellington, New Zealand) and Yde Venema (Amsterdam).
Hard Tautologies
Jan Krajicek (Prague)
Binary Inductive Logic
Jeff Paris (Manchester)
Inductive Logic as conceived by Rudolf Carnap, and some 20 years early by W.E.Johnson, was intended to formalise inductive reasoning, in particular how to reason from particular cases to generalities. Unfortunately, despite a promising start, it never developed beyond unary predicate languages for (misguided) reasons that I will briefly explain. In the real world however we sometimes do apply induction to binary and higher arity predicates and I shall describe some recent work aimed at elucidating the possible underlying principles involved and their consequences.

27. Home-Page Of Martin Otto
Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite structures, with I. Hodkinson. Bulletin of Symbolic Logic, volume 9, 2003, pp. 387405.
9th Logic and Computational Complexity Workshop, Wroclaw 2007 (affiliated with LICS)
MATHLOGAPS summer school 2007
mini-course on games and algorithmic model theory)
Homepage of Martin Otto
Shortcuts: Selected Papers List of Publications Teaching Selected Talks ... the end Professor in Mathematics
Logic and Mathematical Foundations of Computer Science
Logic Group

Mathematics Department (FB 4)

Schlossgartenstrasse 7
D-64289 Darmstadt
tel: (+49) 06151-163115
tel: (+49) 06151-164686 (secretary's office)
fax: (+49) 06151-163317 mail: otto [at] formerly Reader in Theoretical Computer Science Department of Computer Science University of Wales Swansea United Kingdom
Research Interests:
  • Mathematical Logic, Model Theory, Complexity Theory Mathematical Foundations of Computer Science Logic in Computer Science Finite and Algorithmic Model Theory FMT homepage RWTH

28. MODNET - Description Of Task VIII
VIII.2 Positive primitive definability and homomorphisms of Finite structures. a) Positive primitive definability and homomorphisms of Finite structures. VIII: Finite model theory and
MODNET Research Training Network in Model Theory Research > Task VIII: Finite model theory and links to computer science
Task VIII: Finite model theory and links to computer science
List of specific problems
VIII.1: Preservation theorems on restricted classes of structures

a) Modal and guarded fragments, with links to graph and hypergraph theory.
c) Preservation under homomorphisms.
VIII.2: Positive primitive definability and homomorphisms of finite structures
a) Positive primitive definability and homomorphisms of finite structures.
b) Explore links with universal algebra in applications to constraint satisfaction problems.
c) Develop better algorithms for evaluating pp-formulas. VIII.3: Descriptive complexity and proof complexity a) Develop a descriptive complexity of subexponential time solvability and explore connections with parameterized complexity theory. c) Extend or simplify Friedgut's conditions on sharp thresholds in random structures through descriptive complexity. Last updated: November 16 2006 19:26 Please send your corrections to: The e-mail address is protected, enable Javascript to see it

29. 1991-92 AFLB Calendar
Finitemodel theory is a study of the logical properties of Finite mathematical structures. This talk gives an overview, including
AFLB is the Algorithms for Lunch Bunch . It is run by Steven Phillips (Oct 91-Jan 92) and Daphne Koller (Jan 92 - Aug 92). Meetings are usually Thursdays at 12:00 p.m., or Thursdays at 4:15 p.m. Talks are held in Margaret Jacks Hall, on the Main Quad of Stanford's campus. Click here for directions.
  • 10 October 1991 Don Knuth (Stanford). Efficient Representations of Perm Groups.
  • 16 October 1991 Igor Riven (NEC). Geometry of Polyhedra.
  • 14 November 1991 Tomasz Radzik . Parametric search with Newton's Method, and an application to the problem of minimizing maximum arc cost in a transshipment network.
  • 21 November 1991 Madhu Sudan (UC-Berkeley). Reconstructing Algebraic Functions from Noisy Data.
  • 5 December 1991 Orli Waarts (Stanford). Simple and Efficient Bounded Concurrent Timestamping, or Bounded Concurrent Timestamp Systems are Comprehensible!.
  • 16 January 1991 Yossi Azar (DEC SRC). The Competitiveness of On-Line Assignments.
  • 23 January 1992 David Patterson (UC-Berkeley). Massively Parallel Computer Architecture: Observations and Need for a New Theoretical Model.
  • 24 January 1992 Micha Sharir (Tel Aviv University). A Subexponential Randomized Incremental Algorithm for Linear Programming.
  • 30. MT4516
    To introduce the student to Finite mathematical structures such as codes, To investigation of Finite structures, as well as the application of Finite
    School of Mathematics and Statistics
    Home About the school Contact Courses ... Personnel list
    Courses in
    and Statistics
    Level 1 Modules Level 2 Modules Level 3 Modules Level 4 Modules ... Level 5 Modules
    2007/2008 Sem. 1 2007/2008 Sem. 2 2008/2009 Sem. 1 2008/2009 Sem. 2
    - To introduce the student to finite mathematical structures such as codes, Latin squares, finite geometries and designs. - To demonstrate relationships between different structures. - To illustrate applications of more classical mathematical disciplines (such as fields and vector spaces) - To investigation of finite structures, as well as the application of finite structures to other branches of mathematics and science.
    By the end of the course students are expected to
    - know the basic definitions and facts about codes, Latin squares, finite geometries and designs. - understand basic existential, constructive and counting proofs, and to be able to reproduce them. - apply the above knowledge to problem solving.

    31. University Of Chicago Press - Collapse And Fragmentation In Finite Sheets - 10.1
    These simple considerations illustrate the universal tendency for material to pile up and concentrate at edges of Finite structures because of gravity.

    32. DBLP: Martin Grohe
    7 EE, Martin Grohe Large Finite structures with Few LkTypes. LICS 1997 216-227. 6, Martin Grohe Existential Least Fixed-Point Logic and its Relatives.
    Martin Grohe
    List of publications from the DBLP Bibliography Server FAQ Coauthor Index - Ask others: ACM DL Guide CiteSeer CSB ... EE Martin Grohe, Martin Hyland Johann A. Makowsky Damian Niwinski : The Ackermann Award 2007. CSL 2007 EE Martin Grohe, : Parameterized Approximability of the Disjoint Cycle Problem. ICALP 2007 EE Anuj Dawar , Martin Grohe, Stephan Kreutzer Nicole Schweikardt : Model Theory Makes Formulas Large. ICALP 2007 EE Martin Grohe, Yuri Gurevich Dirk Leinders Nicole Schweikardt Jerzy Tyszkiewicz ... Jan Van den Bussche : Database Query Processing Using Finite Cursor Machines. ICDT 2007 EE Anuj Dawar , Martin Grohe, Stephan Kreutzer : Locally Excluding a Minor. LICS 2007 EE Rod Downey , Martin Grohe, Mark Weyer : Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148 EE Martin Grohe, Nicole Schweikardt : Randomized Computations on Large Data Sets: Tight Lower Bounds CoRR abs/cs/0703081 EE Martin Grohe: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54 EE Martin Grohe, Christoph Koch Nicole Schweikardt : Tight lower bounds for query processing on streaming and external memory data.

    33. Reflected Overpressure Impulse On A Finite Structure
    The effect of angle of incidence of the shock front on reflected impulse loading on a Finite structure is presented in this report.

    34. Cookies Required
    First, the general features of the propagation properties of the Finite structure have been theoretically analyzed from the phononic band structure of the

    35. Cm9226
    It takes place of the crack thick mesh of usual Finite element. The size effect of Finite structure has been analyzed. The structure thickness and length
    Analyzing Model I Crack Problems of Finite Structures Based on Local-Global Analytical Method
    Feng Jinhui Liu Chuntu
    £¨Institute of Mechanics, Chinese Academy of Sciences Beijing 100080)
    Abstract: This paper analyzes the mode I crack problems of finite structures based on the
    local-global analytical method. The asymptotic expression, a kind of high power singular element is constructed. It takes place of the crack thick mesh of usual finite element. The size effect of finite structure has been analyzed. The structure thickness and length effect on stress intensity factor have been analyzedin detail.

    36. Set Theory And Its Neighbours, Seventh Meeting
    Abstract Finite model theory has strong connections with a number of topics within computer science. For example, assuming that every Finite structure
    Set theory and its neighbours , nineth meeting:
    The nineth one-day conference in the in the series Set theory and its neighbours , took place on Wednesday, 25th April 2001 at the London Mathematical Society building, De Morgan House, 57-58 Russell Square, London WC1. The speakers at the meeting were:
    • Russell Barker (Oxford), Robinson-type relations and the relationship between the k-size and cardinality of finite structures
        In this talk I will introduce the notions of L^k, the restriction of first order logic to k-variables, the k-size of a model and, two conjectures proposed by Anuj Dawar. Then I shall define define a special kind of relation which I shall call a Robinson-type relation and prove some results about these relations. I shall go on to give a translation between these relations and the set of L^3 theories and then use the earlier results to disprove Dawar's second conjecture.
    • (UEA), Combinatorial principles that follow from GCH-like cardinal arithmetic assumptions
        Abstract: We discuss various results showing that at certain cardinals diamond-like principles follow just from local GCH-like assumptions on cardinal arithmetic.
    • Peter Koepke (Bonn)

    37. Cookies Required
    The concept of the density of modes has been lacking a precise mathematical definition for a Finitesize structure. With the explosive growth in the
    What is Scitation? News Contact Us Help MyScitation: Sign In Register Home MyScitation ... Usage Reports Welcome! Sign In Sign up for free Send Feedback ... Learn more about our new features!
    Cookies Required
    ALERT! This service requires a web browser and/or firewall/network configuration that supports and accepts cookies. You may have been redirected to this page for one or more of the following reasons:
  • You are using a browser that supports cookies, but cookie acceptance is disabled. You are using an older browser that does not support cookies. You are utilizing a personal firewall that is configured to override your browser settings and reject cookies. You are accessing Scitation from a network or proxy that is configured to reject cookies.
  • (1) Browsers that support cookies: You may be using a browser that does support cookies, but you have cookies disabled. Setting up your browser to accept cookies is straightforward in most current versions of Scitation's recommended browsers . Once you have enabled cookies, you may continue to the URL you requested or return to the previous page (2) Browsers that do not support cookies: If you are using a browser that does not support cookies, you must upgrade to a cookie-capable browser. Consult the Scitation

    Page 1     1-48 of 48    1