Automatic listing of important observational statements. II
Automatic listing of important observational statements. III
Automatic risk control based on FSA methodology adaptation for safety assessment in intelligent buildings
The main area which Formal Safety Assessment (FSA) methodology was created for is maritime safety. Its model presents quantitative risk estimation and takes detailed information about accident characteristics into account. Nowadays, it is broadly used in shipping navigation around the world. It has already been shown that FSA can be widely used for the assessment of pilotage safety. On the basis of analysis and conclusion on the FSA approach, this paper attempts to show that the adaptation of this...
Automatické formování hypotéz metodou GUHA - teorie a aplikace
Automorphisms of Bounded Abelian Groups.
Automorphisms of concrete logics
The main result of this paper is Theorem 3.3: Every concrete logic (i.e., every set-representable orthomodular poset) can be enlarged to a concrete logic with a given automorphism group and with a given center. Since every sublogic of a concrete logic is concrete, too, and since not every state space of a (general) quantum logic is affinely homeomorphic to the state space of a concrete logic [8], our result seems in a sense the best possible. Further, we show that every group is an automorphism...
Automorphisms of models of bounded arithmetic
We establish the following model-theoretic characterization of the fragment IΔ₀ + Exp + BΣ₁ of Peano arithmetic in terms of fixed points of automorphisms of models of bounded arithmetic (the fragment IΔ₀ of Peano arithmetic with induction limited to Δ₀-formulae). Theorem A. The following two conditions are equivalent for a countable model of the language of arithmetic: (a) satisfies IΔ₀ + BΣ₁ + Exp; (b) for some nontrivial automorphism j of an end extension of that satisfies IΔ₀. Here is the...
Automorphisms of
We study conditions on automorphisms of Boolean algebras of the form (where λ is an uncountable cardinal and is the ideal of sets of cardinality less than κ ) which allow one to conclude that a given automorphism is trivial. We show (among other things) that every automorphism of which is trivial on all sets of cardinality κ⁺ is trivial, and that implies both that every automorphism of (ℝ)/Fin is trivial on a cocountable set and that every automorphism of (ℝ)/Ctble is trivial.
Autonomous posets and quantales
Axial permutations of ω²
We prove that every permutation of ω² is a composition of a finite number of axial permutations, where each axial permutation moves only a finite number of elements on each axis.
Axiomatic foundations for Nonstandard Analysis
Axiomatic foundations of the kinematics common to classical physics and special relativity
Axiomatisation des manipulations symboliques en calcul des prédicats
Axiomatische Mengenlehre ohne Elemente von Mengen.
Axiomatizability in fuzzy logic
Axiomatizability of second order arithmetic with ω-rule
Axiomatizácia fyzikálnych systémov a „kvantové logiky‟
Axiomatización de lógicas monádicas con varios cuantificadores cardinales
Axiomatization and undecidability results for linear betweenness relations
Axiomatization of the forcing relation with an application to Peano Arithmetic