Page 1 Next

Displaying 1 – 20 of 79

Showing per page

Calcoli generali con «tipi» e Logiche generalizzate

Piero Mangani (1984)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

In this paper we introduce a notion of "Generalized Logic" and we study some of its properties.

Canonical Objects in Classes of (n, V)-Groupoids

Celakoska-Jordanova, Vesna (2010)

Mathematica Balkanica New Series

AMS Subj. Classification: 03C05, 08B20Free algebras are very important in studying classes of algebras, especially varieties of algebras. Any algebra that belongs to a given variety of algebras can be characterized as a homomorphic image of a free algebra of that variety. Describing free algebras is an important task that can be quite complicated, since there is no general method to resolve this problem. The aim of this work is to investigate classes of groupoids, i.e. algebras with one binary operation,...

Categoricity of theories in Lκω , when κ is a measurable cardinal. Part 1

Saharon Shelah, Oren Kolman (1996)

Fundamenta Mathematicae

We assume a theory T in the logic L κ ω 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

H. Jerome Keisler, Arnold W. Miller (2001)

Fundamenta Mathematicae

We study categoricity in power for reduced models of first order logic without equality.

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

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 2 β + β is (homogeneously) characterized by a Scott sentence, for all 0 < β₁ < ω₁....

Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems

Jecheva, Veselina, Nikolova, Evgeniya (2009)

Serdica Journal of Computing

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...

Currently displaying 1 – 20 of 79

Page 1 Next