Results 221 to 230 of about 207,997 (268)
Some of the next articles are maybe not open access.
2010
We define a notion of logic that provides a general framework for the study of extensions of first-order predicate calculus. The concept of partial isomorphism and its relation to infinitary logics are examined. Results on the definability of ordinals establish the setting for our proof of Lindstrom's Theorem: this theorem gives conditions that ...
openaire +1 more source
We define a notion of logic that provides a general framework for the study of extensions of first-order predicate calculus. The concept of partial isomorphism and its relation to infinitary logics are examined. Results on the definability of ordinals establish the setting for our proof of Lindstrom's Theorem: this theorem gives conditions that ...
openaire +1 more source
Relational data models and category theory (abstract)
Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, 1990Mathematicians use the notion of category to define their universe. While database theorists use the data model to define their universe of discourse. Therefore, a close interconnection between these two disciplines should be anticipated. This paper represents our first effort to explore this interconnection.
openaire +1 more source
Duality for Compact Logics and Substitution in Abstract Model Theory
Mathematical Logic Quarterly, 1985Using no special set-theoretical hypothesis we prove the following, for arbitrary logics L and M generated by a set of quantifiers: (i) If L is compact and \(\equiv_ L=\equiv_ M\), then L and M are equivalent. (ii) if \(L\subseteq M\), then there is the largest logic \(L^+\) such that \(L^+\subseteq M\) and \(\equiv_{L^+}=\equiv_ L.\) We also find an ...
openaire +4 more sources
Quantum information theory for model abstraction techniques
SPIE Proceedings, 2001The intent of this paper to bring forward and explore a possible use of the emerging field of quantum information sciences to the modeling and simulation community. It is desired that this research will open new pathways and partnerships where quantum information theory may be applied to modeling techniques.
Marjorie V. Quant, Ryan Colburn
openaire +1 more source
Natural Models of Homotopy Type Theory (Abstract)
2013Homotopy type theory is an interpretation of constructive Martin-Lof type theory into abstract homotopy theory. It allows type theory to be used as a formal calculus for reasoning about homotopy theory, as well as more general mathematics such as can be formulated in category theory or set theory, under this new homotopical interpretation.
openaire +1 more source
ChemInform Abstract: Theory and Modeling of Asymmetric Catalytic Reactions
ChemInform, 2016AbstractReview: 70 refs.
Yu‐hong Lam +4 more
openaire +1 more source
Abstract Model Theory as a Framework for Universal Logic
2005We suggest abstract model theory as a framework for universal logic. For this end we present basic concepts of abstract model theory in a general form which covers both classical and non-classical logics. This approach aims at unifying model-theoretic results covering as large a variety of examples as possible, in harmony with the general aim of ...
Marta García-Matos, Jouko Väänänen
openaire +1 more source
Inverse topological systems and compactness in abstract model theory
Journal of Symbolic Logic, 1986AbstractGiven an abstract logic , generated by a set of quantifiers Qi, one can construct for each type τ a topological space Sτ, exactly as one constructs the Stone space for τ in first-order logic. Letting T be an arbitrary directed set of types, the set is an inverse topological system whose bonding mappings are naturally determined by the reduct ...
openaire +3 more sources
On Finite Model Theory (Extended Abstract)
1990The subject of this paper is the part of finite model theory intimately related to the classical model theory. In the very beginning of our career in computer science, we attended a few lectures on database theory where databases were inconspicuously allowed to be infinite and then classical model-theoretical theorems were applied.
openaire +1 more source
An Illustrated Guide to the Model Theory of Supertype Abstraction and Behavioral Subtyping
2018Object-oriented (OO) programs, which use subtyping and dynamic dispatch, make specification and verification difficult because the code executed by a method call may dynamically be dispatched to an overriding method in any subtype, even ones that did not exist at the time the program was specified. Modular reasoning for such programs means allowing one
Gary T. Leavens, David A. Naumann
openaire +2 more sources