Results 81 to 90 of about 923,849 (196)
Monoids with tests and the algebra of possibly non-halting programs [PDF]
, 2015 We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Marcel Jackson +3 more
core +1 more source
Implicative algebras and Heyting algebras can be residuated lattices
, 2017 The commutative residuated lattices were first introduced by M. Ward and R.P. Dilworth as generalization of ideal lattices of rings. Complete studies on residuated lattices were developed by H. Ono, T. Kowalski, P. Jipsen and C. Tsinakis. Also, the concept of lattice implication algebra is due to Y. Xu.
Basim Samir, Huda Hamdan Merdach
openaire +2 more sources
Congruence Relations on Lattice Implication Algebras
Journal of Mathematics Research, 2011 Lattice implication algebra is an important logic algebra, congruence relations is one of important contents in it. The basic properties and the structures of general congruence relations on lattice implication algebras are discussed; The results that a lattice implication algebra is congruence-permutable is obtained.
Yi Liu, Yang Xu, Ya Qin, Chengxi Liu
openaire +2 more sources
Rational points on even‐dimensional Fermat cubics
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
Syntactic System of lattice-valued Propositional logic based on finite lattice implication algebra
, 2004 By taking finite lattice implication algebra as a truth2value field , a syntactic system of lattice2 valued propositional logic based on finite lattice implication algebra was proposed.
Gao, Y, Qin, K, Xu, Y, Ma, J
core
Uncertainty reasoning based on filter of lattice implication algebra
, 2003 In this paper, we took filter of lattice implication algebra as the measure of reliability for premises and inference rule and applied it to uncertainty reasoning. Firstly, we analyzed the properties of filter and pointed out that it can be regarded as a
Gao, Y, Ma, J, Li, T
core +1 more source
On the (un)decidability of a near-unanimity term [PDF]
, 2007 We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two ...
Maróti, Miklós
core +1 more source
Frequency‐dependent contraction rates for the Bayesian method to the inverse source problem
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract This paper addresses an inverse source problem for acoustic waves in a range of frequencies. Our study has two main goals. First, although the problem is severely ill‐posed with a logarithmic stability estimate, we demonstrate, through careful analysis of the forward map's singular values, that increasing the frequency range enhances stability,
Pu‐Zhao Kow, Jenn‐Nan Wang
wiley +1 more source
The Weil algebra and the Van Est isomorphism [PDF]
, 2011 This paper belongs to a series of papers devoted to the study of the cohomology of classifying spaces. Generalizing the Weil algebra of a Lie algebra and Kalkman’s BRST model, here we introduce the Weil algebra W(A) associated to any Lie algebroid A.
Marius Crainic +9 more
core +2 more sources