Search results for "Finitary"

showing 6 items of 16 documents

Serial subalgebras of finitary Lie algebras

2000

A Lie subalgebra L of glK(V ) is said to be finitary if it consists of elements of finite rank. We show that, if L acts irreducibly on V , and if V is infinite-dimensional, then every non-trivial ascendant Lie subalgebra of L acts irreducibly on V too. When CharK 6= 2, it follows that the locally solvable radical of such L is trivial. In general, locally solvable finitary Lie algebras over fields of characteristic 6= 2 are hyperabelian.

Discrete mathematicsPure mathematicsApplied MathematicsGeneral MathematicsLie algebraSubalgebraFinitaryRank (graph theory)Mathematics::Representation TheoryAscendantMathematicsProceedings of the American Mathematical Society
researchProduct

Finitary Representations and Images of Transitive Finitary Permutation Groups

1999

Abstract We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.

Discrete mathematicshomomorphic imagesMathematics::CombinatoricsAlgebra and Number Theorypermutation groupsfinitary groupsBit-reversal permutationGeneralized permutation matrixPermutation groupCyclic permutationCombinatoricsMathematics::LogicPermutationwreath productsWreath productMathematics::Category TheoryComputer Science::Logic in Computer ScienceFinitaryPermutation graphMathematicsJournal of Algebra
researchProduct

Deontology of Compound Actions

2018

This paper, being a companion to the book [2] elaborates the deontology of sequential and compound actions based on relational models and formal constructs borrowed from formal linguistics. The semantic constructions presented in this paper emulate to some extent the content of  [3] but are more involved. Although the present work should be regarded as a sequel of [3] it is self-contained and may be read independently. The issue of permission and obligation of actions is presented in the form of a logical system . This system is semantically defined by providing its intended models in which the role of actions of various types (atomic, sequential and compound ones) is accentuated. Since the…

Relation (database)LogicComputer sciencePermission050905 science studies0603 philosophy ethics and religionAtomic actionHistory and Philosophy of ScienceCompound actionCanonical modelFinitaryFrameGödel's completeness theoremObligationAxiomSequential action05 social sciences06 humanities and the artsFocus (linguistics)AlgebraProhibitionObligation060302 philosophy0509 other social sciencesComputational linguisticsModelStudia Logica
researchProduct

Finitary formal topologies and Stone’s representation theorem

2008

AbstractWe study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theorem for distributive lattices. We work within the framework of a minimalist foundation (as proposed by Maria Emilia Maietti and the second author). Both inductive and co-inductive methods are used in most proofs.

Stone's representationGeneral Computer ScienceRelation (database)Representation theoremFormal topologyformal topology; positivity; Stone's representation; constructive methodsPositivityBasis (universal algebra)Topological spaceStone’s representationMathematical proofConstructiveTheoretical Computer ScienceConstructive methodsAlgebraDistributive propertyFinitaryComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Modal Consequence Relations Extending S4.3: An Application of Projective Unification

2016

We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…

projective unificationPure mathematicsUnificationLogicFinite model property02 engineering and technology68T15Lattice (discrete subgroup)01 natural sciencesadmissible rulesComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineeringCountable setFinitaryHeyting algebra08C150101 mathematics03B45MathematicsDiscrete mathematics010102 general mathematicsquasivarietiesModal logicstructural completenessconsequence relations03B35Distributive property06E25$\mathbf{S4.3}$S4.3020201 artificial intelligence & image processingNotre Dame Journal of Formal Logic
researchProduct

Subgroups of SF(ω) and the relation of almost containedness

2016

The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to these relations by the standard scheme of P(ω)P(ω). We obtain some consistency results concerning these numbers and some versions of the Ramsey theorem.

subgroups of finitary permutationsvan Douwen diagramArchive for Mathematical Logic
researchProduct