Search results for "definability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
13	Samson Abramsky	Game Semantics: Achievements and Prospects.	ICALP	2000	DBLP DOI BibTeX RDF
13	Alexander Leontjev, Vladimir Yu. Sazonov	Capturing LOGSPACE over Hereditarily-Finite Sets.	FoIKS	2000	DBLP DOI BibTeX RDF
13	Olivier Ly	The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite.	FSTTCS	2000	DBLP DOI BibTeX RDF
13	Peter Schefe	Softwaretechnik und Erkenntnistheorie.	Inform. Spektrum	1999	DBLP DOI BibTeX RDF	Anforderungsanalyse, Spezifikation, Repräsentation, Begriffsbildung, Definierbarkeit, Objekt-orientierte Modellierung, Modell, Prototyp
13	Alexei P. Stolboushkin, Michael A. Taitslin	Normalizable linear orders and generic computations in finite models.	Arch. Math. Log.	1999	DBLP DOI BibTeX RDF
13	Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo	Some Computational Properties of Intersection Types.	LICS	1999	DBLP DOI BibTeX RDF
13	Erich Grädel, Eric Rosen	Two-Variable Descriptions of Regularity.	LICS	1999	DBLP DOI BibTeX RDF
13	M. J. Poole, Arun V. Holden, John V. Tucker	Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms.	Prospects for Hardware Foundations	1998	DBLP DOI BibTeX RDF
13	James Laird	Full Abstraction for Functional Languages with Control.	LICS	1997	DBLP DOI BibTeX RDF
13	Jouko A. Väänänen	Generalized Quantifiers, an Introduction.	ESSLLI	1997	DBLP DOI BibTeX RDF
13	Heribert Vollmer	A Generalized Quantifier Concept in Computational Complexity Theory.	ESSLLI	1997	DBLP DOI BibTeX RDF
13	James Rogers	Strict LT2 : Regular : : Local : Recognizable.	LACL	1996	DBLP DOI BibTeX RDF
13	Gérard Boudol, Carolina Lavatelli	Full Abstraction for Lambda Calculus with Resources and Convergence Testing.	CAAP	1996	DBLP DOI BibTeX RDF	intersection type systems, calculus, full abstraction
13	Anders Malmström	Optimization Problems with Approximation Schemes.	CSL	1996	DBLP DOI BibTeX RDF
13	Andreas Potthoff	First-Order Logic on Finite Trees.	TAPSOFT	1995	DBLP DOI BibTeX RDF
13	Luc Bougé, David Cachera	On the Completeness of a Proof System for a Simple Data-Parallel Programming Language.	Euro-Par	1995	DBLP DOI BibTeX RDF	Specifying and Verifying and Reasoning about Programs, Concurrent Programming, Hoare Logic, Weakest Preconditions, Proof System, Data-Parallel Languages, Semantics of Programming Languages
13	Anuj Dawar, Steven Lindell, Scott Weinstein	First Order Logic, Fixed Point Logic and Linear Order.	CSL	1995	DBLP DOI BibTeX RDF
13	Corrado Böhm, Adolfo Piperno, Stefano Guerrini	Lambda-Definition of Function(al)s by Normal Forms.	ESOP	1994	DBLP DOI BibTeX RDF
13	Stéphane Grumbach, Jianwen Su	Finitely Representable Databases.	PODS	1994	DBLP DOI BibTeX RDF
13	Alexei P. Stolboushkin, Michael A. Taitslin	Is First Order Contained in an Initial Segment of PTIME?	CSL	1994	DBLP DOI BibTeX RDF
13	Andreas Potthoff	Modulo Counting Quantifiers Over Finite Trees.	CAAP	1992	DBLP DOI BibTeX RDF
13	Marie Duzí	Semantic Information Connected with Data.	ICDT	1992	DBLP DOI BibTeX RDF
13	Paola Inverardi, Simone Martini 0001, Carlo Montangero	Is Type Checking Practical for System Configuration?	TAPSOFT, Vol.2	1989	DBLP DOI BibTeX RDF
13	Francis Bossut, Max Dauchet, Bruno Warin	Automata and Rational Expressions on Planar Graphs.	MFCS	1988	DBLP DOI BibTeX RDF
13	Michal Grabowski	On Relative Completeness of Programming Logics.	POPL	1984	DBLP DOI BibTeX RDF
13	David Harel, Dexter Kozen	A Programming Language for the Inductive Sets, and Applications.	ICALP	1982	DBLP DOI BibTeX RDF
13	Johann A. Makowsky	Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. (Errata: ICALP 1981: 551)	ICALP	1980	DBLP DOI BibTeX RDF

Displaying result #701 - #727 of 727 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8]