Gödel's diagonalization technique and related properties of theories
A. Macintyre, H. Simmons (1973)
Colloquium Mathematicae
Similarity:
A. Macintyre, H. Simmons (1973)
Colloquium Mathematicae
Similarity:
Boudet, Alexandre (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Enrique Casanovas, Rodrigo Peláez, Martin Ziegler (2011)
Fundamenta Mathematicae
Similarity:
We prove that every many-sorted ω-categorical theory is completely interpretable in a one-sorted ω-categorical theory. As an application, we give a short proof of the existence of non-G-compact ω-categorical theories.
Ribeiro, Hugo (1956)
Portugaliae mathematica
Similarity:
Stuart S. Antman, Friedemann Schuricht (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
We treat the problem of constructing exact theories of rods and shells for thin incompressible bodies. We employ a systematic method that consists in imposing constraints to reduce the number of degrees of freedom of each cross section to a finite number. We show that it is very difficult to produce theories that exactly preserve the incompressibility and we show that it is impossible to do so for naive theories. In particular, many exact theories have nonlocal effects. ...
Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the...
C. Becchi, A. Rouet, R. Stora (1975)
Recherche Coopérative sur Programme n°25
Similarity:
Kapetanović, M. (1999)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Krynicki Michał
Similarity:
CONTENTS Introduction.................................................................................5 1. Algebras of monotone quantifiers.............................................7 1.1. Family of monotone quantifiers............................................7 1.2. Lattice of monotone quantifiers............................................8 1.3. Other operations in M(κ)......................................................9 ...
Radev, Slavian (2007)
Serdica Journal of Computing
Similarity:
In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in...
Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the...