Home  - Mathematical_Logic - Inductive Definability
 Images Newsgroups
 Page 1     1-56 of 56    1

 1. Inductive Definability With Counting On Finite Structures Inductive definability with Counting on Finite Structures. Source, Lecture Notes In Computer Science; Vol. 702 archive Selected Papers from the Workshop onhttp://portal.acm.org/citation.cfm?id=736402

2. Infinitary Logic And Inductive Definability Over Finite Structures
Infinitary Logic and Inductive definability over Finite Structures. AUTHOR(S) Anuj Dawar, University of Pennsylvania
http://repository.upenn.edu/cis_reports/365/
 HOME SEAS CIS 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

 3. JSTOR Uniform Inductive Definability And Infinitary Languages Inductive definability AND INFINITARY LANGUAGES 111 set T of sentences of LA, if every A~finite subset of T has a model then T has a model.http://links.jstor.org/sici?sici=0022-4812(197603)41:1<109:UIDAIL>2.0.CO;2-Z

4. Global Inductive Definability
Global Inductive definability. Jon Barwise and Yiannis N. Moschovakis. Source J. Symbolic Logic Volume 43, Issue 3 (1978), 521534.
http://projecteuclid.org/handle/euclid.jsl/1183740258
• Home Browse Search ... next
##### Global Inductive Definability
Jon Barwise and Yiannis N. Moschovakis Source: J. Symbolic Logic Volume 43, Issue 3 (1978), 521-534.
##### Abstract
We show that several theorems on ordinal bounds in different parts of logic are simple consequences of a basic result in the theory of global inductive definitions. Full-text: Remote access If you are a member of the ASL, log in to Euclid for access. Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR. Links and Identifiers Permanent link to this document: http://projecteuclid.org/euclid.jsl/1183740258 JSTOR: links.jstor.org back to Table of Contents previous next
##### Journal of Symbolic Logic

5. Logic And Language Links - Inductive Definability
Inductive definability is a subtopic of recursion theory. Inductive definability has currently no subtopics. Long description Not available yet.
http://staff.science.uva.nl/~caterina/LoLaLi/Pages/313.html
 Siblings tell me more... under recursion theory TOP You have selected the concept inductive definability This concept has currently no gloss. inductive definability is a: subtopic of recursion theory inductive definability has currently no subtopics. Long description: Not available yet. Search the hierarchy with v7 Caterina Caracciolo home page Home Search this site with Dowser Page generated on: 2004:9:7, 15:41 Information about LoLaLi.net Handbook Not available yet tell me more...

 6. Infinitary Logic And Inductive Definability Over Finite Structures Infinitary Logic and Inductive definability over Finite Structures. Anuj Dawar, Steven Lindell, Scott Weinstein. Journal Title Information and Computationhttp://wotan.liu.edu/docis/show?doc=dbl/infcom/199506_119_2_160_ILAIDO.htm&query

 7. Scientific Commons Inductive Definability With Counting On Finite Keywords, Erich Gradel,Martin Otto Inductive definability with Counting on Finite Structures. Language, Englisch. About ScientificCommons Imprint Contacthttp://en.scientificcommons.org/400208

8. Citations: Bounded Set Theory And Inductive Definability - Yu (ResearchIndex)
V.Yu.Sazonov, Bounded Set Theory and Inductive definability, Logic Colloquium 90, JSL, 56, Nu.3 (1991) 11411142.
http://citeseer.comp.nus.edu.sg/context/208656/0
 7 citations found. Retrieving documents... Sazonov, V.Yu.: Bounded set theory and inductive definability . Abstracts of Logic Colloquium'90. JSL 56 Nu.3 (1991) 11411142 @ NUS Home/Search Document Not in Database Summary Related Articles Check This paper is cited in the following contexts: Databases as Diagram Algebras: Specifying Queries and Views Via.. - Diskin (1996) (Correct) ....theory mailing list, and a proper definition of the universal property was found by Thomas Streicher Bounded toposes constitutes a universe for tractable set and function diagram operations. In fact, they seem to be a diagram counterpart of bounded set theory advocated and studied by Sazonov ( ) To state precise relations between the three frameworks query languages in the database theory, bounded set theory, bounded toposes a further research is needed. 4.2 Objects and views revised. The great flexibility of sketches with diagram operations can be checked in the framework .... V. Ju. Sazonov. Bounded set theory and inductive definability . J.Symbolic Logic, 56:11411142, 1991.

9. LC '98 Abstract: Martin Grohe Phokion G. Kolaitis
Most of the work on Inductive definability during this period was local, in the sense that it studied Inductively definable relations on some fixed infinite
http://www.math.cas.cz/~lc98/abstracts/Grohe.html
##### Martin Grohe Phokion G. Kolaitis
Institut fuer mathematische Logik, Eckerstr. 1, 79104 Freiburg, Germany Computer Science Department, University of California, Santa Cruz, CA 95064, USA
Martin.Grohe@mathematik.uni-freiburg.de kolaitis@cse.ucsc.edu
References [1] J. Barwise, Admissible Sets and Structures, Springer-Verlag, 1975. [2] J. Barwise and Y.N. Moschovakis. Global inductive definability. Journal of Symbolic Logic, 43:521-534, 1978. [3] H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer, 1995. [4] T.J. Grilliot. Inductive definitions and computability. Transactions of the American Mathematical Society, 158: 309-317, 1971. [5] Y.N. Moschovakis. Elementary Induction on Abstract Structures, North-Holland, 1974. [6] Y.N. Moschovakis, On nonmonotone inductive definability. Fundamenta Mathematicae, 82:39-83, 1974.

 10. Inductive Definability With Counting On Finite Structures. D2R Inductive definability with Counting on Finite Structures. Resource URI http//www4.wiwiss.fuberlin.de/dblp/resource/record/conf/csl/GradelO92http://www4.wiwiss.fu-berlin.de/dblp/resource/record/conf/csl/GradelO92

11. British Library Direct: Order Details
Order from the British Library The Complexity of Inductive definability.
http://direct.bl.uk/research/58/3B/RN169109495.html
 This is an article from British Library Direct, a new service that allows you to search across 20,000 journals for free and order full text using your credit card. Article details Article title The Complexity of Inductive Definability Author Cenzer, D. Remmel, J. B. Journal title LECTURE NOTES IN COMPUTER SCIENCE Bibliographic details 2005, ISSU 3526, pages 75-85 Publisher SPRINGER-VERLAG Country of publication Germany ISBN ISSN Language English Pricing To buy the full text of this article you pay: service charge Abstract: By using this site you agree to our Terms and Conditions Privacy policy We welcome your comments

 12. Infinitary Logic And Inductive Definability Over Finite Structures Infinitary Logic and Inductive definability over Finite Structures. Resource URI http//dblp.l3s.de/d2r/resource/publications/journals/iandc/DawarLW95http://dblp.l3s.de/d2r/resource/publications/journals/iandc/DawarLW95

13. Inductive Definability And The Situation Calculus
We explore the situation calculus within the framework of Inductive definability. A consequence of this view of the situation calculus is to establish
http://nsdl.org/resource/2200/20061011153830956T

14. Cornell Math - Logic Seminar 1996-97
Inductive definability. Thu., October 24, Nat Miller, Cornell University The role of diagrams in proofs Inductive definability partial fixed points
http://www.math.cornell.edu/Colloquia/Logic/1996-97.html
##### List of Talks given in 1996-97
Thu., August 29 Robert Milnikel , Cornell University
Finite automata and finite model theory Tue., September 3 Max Kanovich , Moscow and University of Pennsylvania
Resource automata Thu., September 5 Max Kanovich , Moscow and University of Pennsylvania
Resource automata, part 2 Tue., September 10 Robert Milnikel , Cornell University
Finite automata and finite model theory II Thu., September 12 Miklos Erdelyi-Szabo , Cornell University
Decidability in the intuitionisitic/constructive theory of the reals Tue., September 17 Reed Solomon , Cornell University
The finite model property Thu., September 19 Miklos Erdelyi-Szabo , Cornell University
Decidability and the constructive/intuitionisitic theory of the real line II Tue., September 24 Vivian Morley , Cornell visitor
Inductive definitions Thu., September 26 Denis Hirschfeldt , Cornell University
The density of branching degrees Tue., October 1 Vivian Morley , Cornell visitor
Inductive definitions II Thu., October 3

 15. ODOBS - Publication Page: Infinitary Logic And Inductive Definability Over Finit Infinitary Logic and Inductive definability over Finite Structures. Authors. Anuj DAWAR; Steven LINDELL; Scott WEINSTEIN. Citing publicationshttp://odobs.cs.uni-dortmund.de:8080/odobs/publication;jsessionid=45C8609AD8477D

 16. ELECTRONIC NEWSLETTER ON REASONING ABOUT ACTIONS AND CHANGE Issue I wrote a paper Inductive definability and the Situation Calculus presented at Dynamics 97 last October. It was published in a volume of LNCS later.http://www.ida.liu.se/ext/etai/rac/nl98/054/direct.txt

17. MGI - Publications: Martin Otto
Inductive definability with Counting on Finite Structures. In Computer Science Logic, 6th Workshop, CSL 92, San Miniato 1992, Selected Papers (E. BÃ¶rger,
http://logic.rwth-aachen.de/Publications/otto.html.en
##### Martin Otto
E. GrÂ¤del, C. Hirsch, and M. Otto. Back and Forth Between Guarded and Modal Logics ACM Transactions on Computational Logics , vol. 3(3), pp. 418 Ã¢ÂÂ 463, 2002. ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  BibTeX Abstract E. GrÂ¤del, C. Hirsch, and M. Otto. Back and Forth Between Guarded and Modal Logics . In Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000 , pp. 217Ã¢ÂÂ228, Santa Barbara, 2000. ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ ÃÂ  BibTeX Abstract We propose a second-order extension for the guarded fragment showing that several canonical extensions are in fact equivalent. Then we ask the question in how far results from the modal world can be brought into the world of guarded logics. We give a transformation from first-order structures to Kripke type transition systems. This is used here to transform a theorem due to Janin and Walukiewicz about the expressive completeness of fixed-point logic in the context of bisimulation invariance. E. GrÂ¤del and M. Otto.

 18. Libra: Infinitary Logic And Inductive Definability Over Finite Structures Infinitary Logic and Inductive definability over Finite Structures(1995). Order By. Year, Rank. Year = 2005. The Expressive Power of TwoVariable Leasthttp://libra.msra.cn/papercited.aspx?id=373382

19. PODS 1998: 89-98
DLW95 Anuj Dawar, Steven Lindell, Scott Weinstein Infinitary Logic and Inductive definability over Finite Structures. Inf. Comput.
http://www.informatik.uni-trier.de/~ley/db/conf/pods/SegoufinV98.html
##### Querying Spatial Databases via Topological Invariants.
Luc Segoufin Victor Vianu : Querying Spatial Databases via Topological Invariants. PODS 1998 DBLP BibTeX
##### Abstract
The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of topological queries against the spatial database into queries against the topological invariant. The languages considered are first-order on the spatial database side, and fixpoint and first-order on the topological invariant side. In particular, it is shown that fixpoint expresses precisely the ptime queries on topological invariants. Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ...
• Windows: Click the letter of your CD drive
A
B C D ... Z UNIX/LINUX/Mac: use mount point or /cdrom/...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...
• Windows: Click the letter of your CD drive
A
B C D ... Z UNIX/LINUX/Mac: use mount point or /cdrom/...
BibTeX
##### Printed Edition
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington. ACM Press 1998, ISBN 0-89791-996-3

 20. \newcommand{\apal}{{\it Annals Of Pure And Applied Logic \bibitemGO93{GradelOtto}E.~Gr\ {a}del and M.~Otto, `Inductive definability with Counting on Finite Structures, {\em Computer Science Logic} 1993,http://www.cs.umass.edu/~immerman/book/biblio.html

 21. Books, Surveys @BOOK{EFfinmt, AUTHOR = Heinz-Dieter Ebbinghaus TITLE = Infinitary Logic and Inductive definability over Finite TITLE = Implicit definability and Infinitary Logic in Finite Model Theory ,http://www.cs.ioc.ee/~tarmo/bibs/fmt.bib

Sazonov, A bounded set theory with antifoundation axiom and Inductive definability, L.Pacholski and J.Tiuryn (Eds.). Computer Science Logic.
http://www.csc.liv.ac.uk/~sazonov/papers.html
##### Vladimir Sazonov: Some Papers and Publications
Papers on Bounded Set Theory
• Vladimir Sazonov Collection principle and existential quantifier pages 1-2 pages 3-4 pages 5-6 pages 7-8 , Amer. Math. Soc. Transl. (2) Vol.142, 1989, pp.18. (English translation of a paper in Russian published in Logiko-matematicheskie problemy MOZ., Vychislitel'nye sistemy N107, 1985, Novosibirsk, 3039.)
• Vladimir Sazonov Hereditarily-finite sets, data bases and polynomial-time computability , Theoretical Computer Science, 119 (1) (1993) pp. 187-214 V.Yu.Sazonov On Bounded Set Theory , Invited talk on the 10th International, Congress on Logic, Methodology and Philosophy of Sciences, Florence, August 1995, in Volume I: Logic and Scientific Method, Kluwer Academic Publishers, 1997, pp. 85103 V.Yu.Sazonov A bounded set theory with anti-foundation axiom and inductive definability , L.Pacholski and J.Tiuryn (Eds.). Computer Science Logic. 8th Workshop, CSL'94, Kazimierz, Poland, Sept. 1994. Selected papers. (Lecture Notes in Computer Science; vol. 933) Berlin, Springer, 1995, pp. 527541. A. P. Lisitsa

23. DBLP: Dexter Kozen
95 EE, Dexter Kozen Computational Inductive definability. Ann. Pure Appl. Logic 126(13) 139-148 (2004). 94 EE, Dexter Kozen Some results in dynamic
http://www.sigmod.org/dblp/db/indices/a-tree/k/Kozen:Dexter.html
##### Dexter Kozen
List of publications from the DBLP Bibliography Server FAQ Coauthor Index - Ask others: ACM DL ACM Guide CiteSeer CSB ... EE Dexter Kozen, Nicholas Ruozzi : Applications of Metric Coinduction. CALCO 2007 EE Dexter Kozen: Coinductive Proof Principles for Stochastic Processes CoRR abs/0711.0194 EE Dexter Kozen: Preface. Sci. Comput. Program. 65 EE Dexter Kozen, Christoph Kreitz Eva Richter : Automating Proofs in Category Theory. IJCAR 2006 EE Dexter Kozen: Coinductive Proof Principles for Stochastic Processes. LICS 2006 EE Dexter Kozen: On the Representation of Kleene Algebras with Tests. MFCS 2006 EE Kamal Aboul-Hosn , Dexter Kozen: Relational Semantics for Higher-Order Programs. MPC 2006 EE Kamal Aboul-Hosn , Dexter Kozen: Local Variable Scoping and Kleene Algebra with Tests. RelMiCS 2006 Kamal Aboul-Hosn , Dexter Kozen: KAT-ML: an interactive theorem prover for Kleene algebra with tests. Journal of Applied Non-Classical Logics 16 EE Ruy J. G. B. de Queiroz , Dexter Kozen: Logic, Language, Information and Computation. Theor. Comput. Sci. 355 EE Chavdar Botev Hubert Chao ... David Gries , Dexter Kozen, Andrew C. Myers

24. Publications
It is shown that in the presence of counting terms Inductive definability on arbitrary finite structures has nice properties that it retains without
##### Martin Otto: PUBLICATIONS with ABSTRACTS
Modal Characterisation Theorems over Special Classes of Frames , with A. Dawar
Preprint of extended and corrected journal version of LICS 2005 paper , 2007, 48 pages. Abstract The Boundedness Problem for Monadic Universal First-Order Logic
Proceedings of 21th IEEE Symposium on Logic in Computer Science LICS 2006, pp 37-46. Abstract Consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula that is positive in $X$, decide whether there is a uniform finite bound on the least fixed point recursion based on this formula. Few fragments of FO are known to have a decidable boundedness problem; boundedness is known to be undecidable for many fragments. We here show that monadic boundedness is decidable for purely universal FO formulae without equality in which each non-recursive predicate occurs in just one polarity (e.g., only negatively). The restrictions are shown to be essential: waving either the polarity constraint or allowing positive occurrences of equality, the monadic boundedness problem for universal formulae becomes undecidable. The main result is based on a model theoretic analysis involving ideas from modal and guarded logics and a reduction to the monadic second-order theory of trees. Modal Characterisation Theorems over Special Classes of Frames , with A. Dawar

25. Group In Logic And The Methodology Of Science -
Inductive definability. Branden Fitelson, Assistant Professor of Philosophy, San Jose State University, and Assistant Professor Designate of Philosophy,
http://logic.berkeley.edu/past-colloquia.html
##### Past Colloquia
Thomas Scanlon , Associate Professor of Mathematics, University of California, Berkeley John Krueger , Morrey Assistant Professor of Mathematics, University of California, Berkeley Some Results on Internal Approachability Sherrilyn Roush , Associate Professor of Philosophy, University of California, Berkeley Knowledge of Logical Truth Dana S. Scott , University Professor Emeritus, Carnegie Mellon University; Visiting Scholar in Logic and the Methodology of Science, University of California, Berkeley Duality in Projective Geometry Assaf Sharon , Visiting Assistant Professor of Mathematics, University of California, Irvine Some Consistency Results in Singular Cardinal Combinatorics Alexander Usvyatsov , Adjunct Assistant Professor of Mathematics and Fellow of the Logic Center, University of California, Los Angeles Model Theory of Metric Structures: An Overview Jose Ferreiros , Associate Professor of History and Philosophy of Science, University of Sevilla, Spain; Visiting Scholar in Philosophy, University of California, Berkeley Is the Concept of Set Intuitive?

26. List KWIC PACS And MSC+ZDM E-N Lexical Connection
induction, Burnside and representation rings Frobenius 19A22 Inductive and projective limits 46M40 Inductive definability 03D70
http://www.math.unipd.it/~biblio/kwic/msc-pacs/pml_11_043.htm
 imaging # NMR 76.60.Pc imaging # NMR/magnetic resonance 83.85.Fg imaging # pulse sequences for 87.61.Cd imaging # transmission 87.59.Jq imaging # visible radiation: diaphanography, transillumination, laser 87.63.Lk imaging # x-ray 87.59.-e imaging and optical processing 42.30.-d imaging and signal processing # biomedical imaging detectors and sensors 42.79.Pw imaging equipment # medical 87.62.+n imaging in therapy # portal 87.53.Oq imaging studies # clinical 87.61.Pk imaging, dosimetry, labeling, metabolic studies # nuclear medicine 87.58.-b imaging: general # medical 87.57.-s imbeddable into projective geometries # incidence structures imbedding # topological graph theory, imbeddings and immersions # spaces of immersions immersions # embeddings and immersions # embeddings and immersions # spaces of imbeddings and immersions (minimal, prescribed curvature, tight, etc.) impact impact # atomic excitation and ionization by electron 34.80.Dp impact # dissociation and dissociative attachment by electron 34.80.Ht

27. Publications Of Jouko VÃ¤Ã¤nÃ¤nen
Gametheoretic Inductive definability, with Juha Oikkonen, Annals of Pure and Applied Logic 65, 265-306, 1993. Logic Colloquium 90 (editor,
http://www.math.helsinki.fi/logic/people/jouko.vaananen/jvaaALL.html
##### Some remarks on pseudocompact spaces. Ann. Acad. Sci. Fenn. Ser. A I Math 559 pp. 11, 1973 Remarks on generalized quantifiers and second-order logics. In Set theory and hierarchy theory , Prace Naukowe Instytutu Matematyki Politechniki Wroclawskiej, Wroclaw, vol. 14 (1977), pages 117-123. Remarks on free quantifier variables, In J.Hintikka, I.Niiniluoto and E.Saarinen, editors, Essays on mathematical and philosophical logic pages 267-272, Reidel, 1978. Two axioms of set theory with applications to logic. Ann. Acad. Sci. Fenn. Ser. A I. Math. Diss. Abstract logic and set theory, I: Definability. In M.Boffa, D.van Dalen and K.McAloon, editors, Logic Colloquium '78 , pages 391-421, North-Holland, 1979. On the Hanf numbers of unbounded logics. In F.Jensen, B.Mayoh and K.Moller, editors, Proceedings from 5th Scandinavian Logic Symposium , pages 309-328, Aalborg University Press, 1979. Archimedes Boolean valued models and generalized quantifiers, Annals of Mathematical Logic , 79, pages 193-225, 1980. On the axiomatisability of the notion of an automorphism of a finite order, with Dionysis Anapolitanos.

28. Cenzer, Douglas
Inductive definability measure and category. Adv. in Math. 38 (1980), no. 1, 5590. 03D70 (03E15 28A05 54H05); 575911 Cenzer, D.; Mauldin, R. D.
http://www.math.ufl.edu/fac/facmr/Cenzer.html
##### Cenzer, Douglas
58 papers

• Brodhead, Paul(1-FL); Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Random continuous functions. (English summary) Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006), 275287 (electronic),
Electron. Notes Theor. Comput. Sci., 167, Elsevier, Amsterdam,
• Brodhead, Paul(1-FL); Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Random continuous functions. (English summary) Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006), 275287 (electronic),
Electron. Notes Theor. Comput. Sci., 167, Elsevier, Amsterdam,
• Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006).
Held at the University of Florida, Gainesville, FL, November 15, 2006. Edited by D. Cenzer, R. Dillhage, T. Grubba and K. Weihrauch. Electronic Notes in Theoretical Computer Science, 167. Elsevier Science B.V., Amsterdam, 2007. front matter+447 pp. (electronic).
• Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)

29. Mhb03.htm
03D70, Inductive definability. 03D75, Abstract and axiomatic computability and recursion theory. 03D80, Applications of computability and recursion theory
http://www.mi.imati.cnr.it/~alberto/mhb03.htm

30. Infinitary Logic And Inductive Definability Over Finite Structures
Infinitary Logic and Inductive definability over Finite Structures. A. Dawar, S. Lindell and S. Weinstein. Information and Computation 119 (1995),
http://www.cis.upenn.edu/~db/abstracts/ic94.html
##### A. DawarS. Lindell and S. Weinstein
Information and Computation 119 (1995), pp 160-175. The extensions of first-order logic with a least fixed point operator (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 investigated the relationship of these two logics in the absence of an ordering, using a machine 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. We investigate this logic of finite structures and provide a normal form for it. We also present a treatment of the results of Abiteboul and Vianu from this point of view. In particular, we show that we can write a formula of FO + LFP that defines an ordering of the L k types uniformly over all finite structures. One consequence of this is a generalization of the equivalence of FO + LFP and P from ordered structures to classes of structures where every element is definable. We also show that FO + LFP is properly contained in the polynomial time computable fragment of L

 31. MathNet-Mathematical Subject Classification 03D70, Inductive definability. 03D75, Abstract and axiomatic recursion theory. 03D80, Applications of recursion theory. 03D99, None of the above,http://basilo.kaist.ac.kr/API/?MIval=research_msc_1991_out&class=03-XX

 32. Cenzer, Mauldin: On The Borel Class Of The Derived Set Operator Inductive definability measure and category, Advances in Math. 38. 5590. 1980. 2 DELLACHERIE(C). - Les derivations en theorie descriptive dcs ensembleshttp://www.numdam.org/numdam-bin/fitem?id=BSMF_1982__110__357_0

33. FOM: Where To Put Complexity Theory
Some of the work of Immerman and Gurevich and Shelah on finite structures is a natural byproduct of this general theory of Inductive definability.
http://cs.nyu.edu/pipermail/fom/1998-August/002026.html
##### FOM: where to put complexity theory
Wayne Richter richter at math.umn.edu
Sun Aug 30 01:03:41 EDT 1998 From the mathematical point of view, I believe that complexity theory More information about the FOM mailing list

34. Scientific Commons Infinitary Logic And Inductive Definability
Infinitary Logic and Inductive definability over Finite Structures (1994). Anuj Dawar,; Steven Lindell,; Scott Weinstein. Abstract
http://de.scientificcommons.org/161554
 <Â²Â¾Ã¿ÃºÃ±RkÃ³#ÃÂÃÃ­Ã±^[Ã©Â¡Ã¾ÃÂ¿@*DÂ«~Â¶ÂiÃ6Ã¶ÂÂcÂIÃ[BÂ sxxXÃ¢yt\$(Ã3ÂL! FÃ£Ã  ÂÂ«kÂ¹,8Â8ÂÂ'

 35. Citebase - A Logic For Non-Monotone Inductive Definitions Inductive definability and the situation calculus. In Transaction and Change in Logic Databases. Lecture Notes in Computer Science, vol. 1472.http://www.citebase.org/abstract?identifier=oai:arXiv.org:cs/0501025&action=cite

36. Sample SRC Proposal For AMS Conferences
Transfinite iterations move on to definability in analysis, descriptive set theory, Inductive definability, generalized recursion theory, admissibility and
http://www.ams.org/meetings/srcsample1.html
 Sample1 Proposal for a Joint Summer Research Conference 1. Proposal submitted by: Steffen Lempp Department of Mathematics University of Wisconsin 480 Lincoln Drive Madison, WI 53706-1388 Phone (608) 263-1975 Fax (608) 263-8891 Email lempp@math.wisc.edu 2. Title of proposed conference: Computability Theory and Applications 3. Organizing committee: Peter Cholak, University of Notre Dame Steffen Lempp (co-chair), University of Wisconsin Manuel Lerman (co-chair), University of Connecticut Richard Shore (co-chair), Cornell University 4. Program information: 4.1. Program summary: Pure computability theory On the other hand, Cooper has recently claimed that there is a nontrivial automorphism of the Turing degrees and indeed of the computably enumerable degrees that shows that these definability results are, in a certain way, the best possible. If Cooper's construction can be understood and applied elsewhere it will provide an entry into a whole new realm of nondefinability results. Computable mathematics Another version of many of these questions is investigated in reverse mathematics as developed by H. Friedman and Simpson. This approach is, on its face, a proof-theoretic and foundational investigation into the axiomatic systems needed to prove standard theorems of classical mathematics. On closer scrutiny, one sees that many of the arguments and results in this area can also be viewed as ones in computable mathematics. There is an almost perfect translation between the proof-theoretic systems used and the established levels of complexity in computability. Each approach, however, contributes its own techniques and often produces results with overlapping but supplementary content.

37. Logic Colloquium 2007 (Wrocław, Poland, July 14-19, 2007)
A. Pillay, Typedefinability, compact Lie groups, and -minimality, J. Math. namely of some fundamental results of Moschovakis on Inductive definability.
http://www.math.wisc.edu/~lempp/conf/ELC07.html
##### Tentative Schedule
Time Saturday, July 14 Sunday, July 15 Monday, July 16 Tuesday, July 17
Wednesday, July 18
Thursday, July 19
Time
registration
opening ceremony
Matthias Baaz
Steve Jackson
(I)

Steve Jackson
...
Kjos-Hanssen
coffee coffee coffee coffee Kobi Peterzil (III) coffee Paul Larson Albert Atserias Fernando Ferreira Martin Hyland coffee Tony Martin Piotr Kowalski Kobi Peterzil (I) ... (II) special sessions: and ST 2 Rosalie Iemhoff Alex Simpson lunch lunch excursions lunch lunch special sessions: JPL 1 and MT 1 Vasco Brattka special sessions: PC and ST 1 Colin Stirling Bakh Khoussainov (II) ... Cristiano Calcagno coffee coffee Bakh Khoussainov (I) coffee Bakh Khoussainov (III) coffee special sessions: JPL 2 and MT 2 contributed talks contributed ... talks break contributed talks ASL reception (LICS participants also invited) ASL banquet Andrzej Grzegorczyk ASL Council meeting Color Coding: joint LICS/LC talks tutorial ... talks ASL business meetings social events/ excursions coffee breaks/ lunch Joint LICS/LC Long Talks: Martin Hyland (Cambridge): Combinatorics of Proofs (chair: Andy Pitts) Abstract: Ideally interpretations of proofs should exhibit some essential combinatorial features in an interesting and appealing way. As a case study, one can consider the notion of innocent strategy which is the basis for a game semantical interpretation of proofs and programmes. Some combinatorial content of this notion is sketched in the joint LICS paper accompanying this talk, whose abstract reads as follows.

 38. Procom5_99p262abs and Inductive definability. V. Yu. Sazonov. Program Systems Institute, Russian Academy of Sciences, PereslavlÂZalesskii, 152140 Russiahttp://www.maik.ru/cgi-bin/search.pl?type=abstract&name=procom&number=5&year=99&

39. Publications
A. Dawar, S. Lindell and S. Weinstein, Infinitary logic and Inductive definability over finite structures, Information and Computation 119 (1995) 160175.
##### Selected Publications
• A. Dawar and D. Richerby, The Power of Counting Logics on Restricted Classes of Finite Structures CSL'07: Computer Science and Logic , Lecture Notes in Computer Science, Springer-Verlag (2007). A. Dawar and S. Kreutzer, Generalising Automaticity to Modal Properties of Finite Structures Theoretical Computer Science A. Dawar and D. Janin, The Monadic Theory of Finite Representations of Infinite Words Information Processing Letters A. Dawar, M. Grohe and S. Kreutzer, Locally Excluding a Minor Proc. 22nd IEEE Symp. on Logic in Computer Science , IEEE Computer Society Press (2007). A. Atserias, A. Bulatov and A. Dawar Affine Systems of Equations and Counting Infinitary Logic Proc. 34th International Colloquium on Automata, Languages and Programming - ICALP'07, Lecture Notes in Computer Science vol. 4596, Springer-Verlag (2007), 558-570. A longer version is available here A. Dawar, M. Grohe, S. Kreutzer and N. Schweikardt, Model Theory Makes Formulas Large Proc. 34th International Colloquium on Automata, Languages and Programming - ICALP'07, Lecture Notes in Computer Science vol. 4596, Springer-Verlag (2007) 913-924. A longer version is available as
• 40. ERROR-INTERNO
arose from the study of Inductive definability and infinitary logic on proficient classes of finite structures (those admitting an unbounded induction).
http://biblioteca.universia.net/html_bura/vernivel/params/nivel/11/start/300.htm
##### Biblioteca.Net
LÃ³gica
MatemÃ¡ticas AstronomÃ­a y AstrofÃ­sica FÃ­sica ... COLECCIONES
RegÃ­strese Usuario: EspaÃ±a Argentina Brasil Chile Colombia MÃ©xico PerÃº Portugal Puerto Rico Venezuela ContraseÃ±a:
PubMed Central (PMC3 - NLM DTD) arXiv Library of Congress Open Archive Initiative Repository 1 mÃ¡s...]
##### Â¡Error Interno!
Â­Error!
Debe corregir el siguiente error o errores antes de continuar:
• Error interno del servidor, vuelva a intentarlo de nuevo.
at net.universia.rayuela.logica.VerCategoriaLogica.doClasificacion(VerCategoriaLogica.java:42)
at net.universia.rayuela.actions.VerCategoriaAction.doAll(VerCategoriaAction.java:34)

Inductive definability and secondorder logic. 4. Time complexity the classes P and NP. 5. Space complexity L, NL, FL and PSPACE. 6.
April 9, 1996
FLOC
TRAVEL BULLETIN * Olympics! The 1996 Olympic Games take place from July 19 to Aug 3rd in Atlanta. This period is also peak tourist season. We have some anecdotal evidence that it is difficult already to get flights to New York and other places for specific days during that time. * Further Information. For the most up-to-date information on FLoC, see the web page. Full travel information will soon be available, but for now the web page has a link to information on travelling to DIMACS. DIMACS is on the Busch campus of Rutgers. FLoC will be held on the College Avenue campus of Rutgers which is just a few miles away. WORKSHOP ON RELEVANCE IN KNOWLEDGE REPRESENTATION AND REASONING 1ST INT'L WORKSHOP ON REWRITING LOGIC AND ITS APPLICATIONS September 3-6, 1996, Asilomar, Pacific Grove, California * Topics. Foundations, models, and extensions of rewriting logic (RWL); uses of rewriting logic as a logical framework; applications of RWL to the specification of languages and systems; applications of RWL to object-oriented specification and programming; applications of RWL to concurrency and parallel programming; programming languages based on rewriting logic. * Submissions. 2,000 word abstract submitted electronically (in postcript format) to the program chair (meseguer@csl.sri.com). Submission of abstracts due to program chair May 1, 1996. * Program Committee. Fiorella De Cindio, Kokichi Futatsugi, Claude Kirchner, Christian Lengauer, Narciso Marti-Oliet, Jose Meseguer, Ugo Montanari, Carolyn Talcott. * Invited Speakers. Narciso Marti-Oliet, Ugo Montanari, Martin Wirsing.

42. BibSonomy::bibtex::Game-Theoretic Inductive Definability.
Webapplikation des Fachgebiets Wissensverarbeitung, UniversitÃ¤t Kassel.
http://www.bibsonomy.org/bibtex/2b7f1ed6b68402aa563e4d3b794016dcc/dblp
##### BibSonomybibtex
tag user group author concept BibTeX key search:all search:dblp cssdropdown.startchrome("path"); A blue social bookmark and publication sharing system. tags relations groups popular ... about username: password: myFriends myRelations mySearch myPDF ... register cssdropdown.startchrome("upper_menu"); cssdropdown.startchrome("lower_menu"); dblp 's BibTeX entry:
##### Game-Theoretic Inductive Definability.
Ann. Pure Appl. Logic, Authors: Juha Oikkonen and Jouko A. VÂ¤Â¤nÂ¤nen URL: http://dblp.uni-trier.de/db/journals/apal/apal65.html#OikkonenV93 Description: dblp Tags: dblp URL BibTeX

 43. [ISI Highly Cited Researchers Version 1.1] Computational Inductive definability. Technical Report 20021870, Computer Science Department, Cornell University, April 2002.. Adam Barth and Dexter Kozen.http://hcr3.isiknowledge.com/formViewCharacteristic.cgi?id=2429&link1=browse&tab

 44. CAT.INIST Inductive definability and the situation calculus We explore the situation calculus within the framework of Inductive definability.http://cat.inist.fr/?aModele=afficheN&cpsidt=1570489

45. JVTucker-Classified List Of Publications
J Moldestad, V StoltenbergHansen and J V Tucker, Finite algorithmic procedures and Inductive definability, Mathematica Scandinavica, 46 (1980) 62-76.
http://www.cs.swan.ac.uk/~csjvt/JVTmore/JVT-Classified Publications.htm
 J V Tucker CLASSIFIED LIST OF PUBLICATIONS I have classified my research publications under the following headings: Books Surveys Computable rings and fields Abstract computability theory ... General articles Within the sections the publications are listed in the order of their publication date; often this does not represent the order of their composition. Most, but not all, publications are included. There are 4 books, 5 major survey articles, and 80+ research papers. In addition, there are some unpublished reports, lecture notes and general articles. Books 1. J V Tucker and J I Zucker, Program correctness over abstract data types with error-state semantics , North-Holland, Amsterdam, 1988, pp. vii+212. 2. K McEvoy and J V Tucker, Theoretical foundations of VLSI design edited work, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990, pp. xi+438. 3. K Meinke and J V Tucker, Many sorted logic and its applications 4. B MÃ¶ller and J V Tucker

46. Stela's Recent Publications
\Pi^0_1positive Inductive definability on abstract structures, Ann. Univ. Sofia, Fac. Math et Inf., 91, 1997; with A. A. Soskova, Theory of programming in
http://www.fmi.uni-sofia.bg/fmi/logic/nikolova/recent.htm
##### Publications of Stela K. Nikolova
• . Compt. Rend. Acad. Bulg. Sci., (10), 1990, pp. 9 - 11. Computability in sense of Moschovakis over multiple-valued abstract structures . Compt. Rend. Acad. Bulg. Sci., (1), 1990, pp. 35 - 37. Admissible functionals in abstract structures with arbitrary power . Ann. Univ. Sofia, Fac. Math. et Mec., , Ann. Univ. Sofia, Fac. Math et Inf., with A. A. Soskova, Theory of programming in problems , SofTeX, Sofia, 1997
•  47. Search - Site - Jack Baskin School Of Engineering, UC Santa Cruz Inductive definability the study of the relations Inductively definable by . Global Inductive definability and finitevariable logics have featured .http://www.soe.ucsc.edu/site/search.html?query=definability

 Page 1     1-56 of 56    1