Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
definability
Description:
Definability is the property of a concept or object being expressible or characterizable within a formal language or logical system.
Primary topic:
Advanced Topology and Set Theory (37%)
Related topics:
Advanced Topology and Set Theory (37%),
Computability, Logic, AI Algorithms (10%),
Logic, Reasoning, and Knowledge (10%),
Advanced Algebra and Logic (7%)
OpenAlex ID:
keywords/definability
Set Theory An Introduction to Independence Proofs
1980
·
Studies in logic and the foundations of mathematics
·
1,501
LCF considered as a programming language
1977
·
G.D. Plotkin
·
Theoretical Computer Science
·
1,134
Model Theory
1993
·
Wilfrid Hodges
·
Cambridge University Press eBooks
·
1,001
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
1957
·
William Craig
·
Journal of Symbolic Logic
·
687
Full Abstraction for PCF
2000
·
Samson Abramsky
, Radha Jagadeesan
, et al.
·
Information and Computation
·
495
Semantical consideration on floyo-hoare logic
1976
·
Vaughan R. Pratt
·
Annual Symposium on Foundations of Computer Science
·
349
Exploring Logical Dynamics
1996
·
Johan van Benthem
·
UvA-DARE (University of Amsterdam)
·
329
Definability and fast quantifier elimination in algebraically closed fields
1983
·
Joos Heintz
·
Theoretical Computer Science
·
318
PDF
On Padoa’s Method in the Theory of Definition
1953
·
E.W. Beth
·
Indagationes Mathematicae (Proceedings)
·
311
Automatic structures
2002
·
A. Blumensath
, E. Gradel
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
303
λ-definability and recursiveness
1936
·
S. C. Kleene
·
Duke Mathematical Journal
·
283
Composing schema mappings: second-order dependencies to the rescue
2004
·
Ronald Fagin
, Phokion G. Kolaitis
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
279
Threshold circuits of bounded depth
1993
·
András Hajnal
, Wolfgang Maass
, et al.
·
Journal of Computer and System Sciences
·
238
Weighted automata and weighted logics
2007
·
Manfred Droste
, Paul Gastin
·
Theoretical Computer Science
·
234
PDF
Tools and Techniques in Modal Logic
1999
·
Kracht, Marcus.
·
Studies in logic and the foundations of mathematics
·
219
Algorithmic uses of the Feferman–Vaught Theorem
2004
·
J.A. Makowsky
·
Annals of Pure and Applied Logic
·
214
A fully abstract game semantics for general references
2002
·
S. Abramsky
, K. Honda
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
212
Trends in Logic
1989
·
Angus Macintyre
·
Studies in logic and the foundations of mathematics
·
206
Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory
1971
·
Saharon Shelah
·
Annals of Mathematical Logic
·
198
PDF
Composing schema mappings: Second-order dependencies to the rescue
2005
·
Ronald Fagin
, Phokion G. Kolaitis
, et al.
·
ACM Transactions on Database Systems
·
194
Weakly Definable Relations and Special Automata
1970
·
Michael O. Rabin
·
Studies in logic and the foundations of mathematics
·
188
Models of Discovery and Other Topics in the Methods of Science.
1979
·
K. Sundaram
, Herbert A. Simon
·
Philosophy and Phenomenological Research
·
170
The Expressiveness of Simple and Second-Order Type Structures
1983
·
Steven Fortune
, Daniel Leivant
, et al.
·
Journal of the ACM
·
163
PDF
Full abstraction for functional languages with control
2002
·
J. Laird
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
147
A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
1986
·
Lou van den Dries
·
Bulletin of the American Mathematical Society
·
147
PDF
Show more works
View as search
Works count:
2,506
Citation count:
29,980
Year
Topic
Type