Cardinalité, saturation et finitude
Categorical, functorial and algebraic aspects of the type-free lambda calculus
Categorical models and quasigroup homotopies.
...-Categorical Stable Groups.
Categoricity of theories in , when κ* is a measurable cardinal. Part 2
We continue the work of [2] and prove that for λ successor, a λ-categorical theory T in is μ-categorical for every μ ≤ λ which is above the -beth cardinal.
Categoricity of theories in Lκω , when κ is a measurable cardinal. Part 1
We assume a theory T in the logic is categorical in a cardinal λ κ, and κ is a measurable cardinal. We prove that the class of models of T of cardinality < λ (but ≥ |T|+κ) has the amalgamation property; this is a step toward understanding the character of such classes of models.
Categoricity without equality
We study categoricity in power for reduced models of first order logic without equality.
Categories of models of infinitary Horn theories
Categories of models of languages
Categories with Ultraproducts
Cayley's theorem for ordered groups: -minimality.
Čech-Stone remainders of spaces that look like
C'est beau et chaud
Chaînes de théories universelles
Chains in Ehrenfeucht Mostowski models
Characterizing the powerset by a complete (Scott) sentence
This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence if has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if is characterized by a Scott sentence, then is (homogeneously) characterized by a Scott sentence, for all 0 < β₁ < ω₁....
Classical logic with some probability operators.
Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing...
Clones, coclones and coconnected spaces.
Club-guessing and non-structure of trees
We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.