A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
On the representation of L-M algebra by intuitionistic fuzzy subsets

2006
*
ARIMA
*

Conversely, we show that every involutive

doi:10.46298/arima.1845
fatcat:idrtcrkh35g2rauh7chqhx6c44
*theta*-*valued**Lukasiewicz*-Moisil*algebra*can be embedded into an*algebra*of intuitionistic fuzzy subsets. ... These notions lead us to show that the set IF(X) of all intuitionistic fuzzy subsets on a universe X can be equipped with a structure of involutive*theta*-*valued**Lukasiewicz*-Moisil*algebra*. ... Iorgulescu*for*useful remarks and suggestions concerning this paper. The authors are also grateful to the editor and referees*for*their useful remarks and suggestions concerning this paper. ...##
###
Bounded discrete walks

2010
*
Discrete Mathematics & Theoretical Computer Science
*

*For*the family of walks consisting of a $-1$ jump and many positive jumps, we give more precise bounds

*for*the speed of convergence. ... These formulae also lead to fast algorithms

*for*computing the $n$-th Taylor coefficients of the corresponding generating functions. ... We thank the referees

*for*their comments. ...

##
###
Fourier's Method of Linear Programming and Its Dual

1986
*
The American mathematical monthly
*

11F27

doi:10.2307/2322281
fatcat:yvhgyh2epbcwdoqdhuaopkcrue
*Theta*series; Weil*representation*;*theta*correspondences 11F30 Fourier coefficients of automorphic forms 11F32 Modular correspondences, etc. 11F33 Congruences*for*modular and p-adic modular ... 22D25 C * -*algebras*and W * -*algebras*in relation to group*representations*[See also 46Lxx] 22D30 Induced*representations*22D35 Duality*theorems*22D40 Ergodic theory on groups [See also 28Dxx ... this section 83Cxx General relativity 83C05 Einstein's equations (general structure, canonical formalism, Cauchy problems) 83C10 Equations of motion 83C15 Exact solutions 83C20 Classes of solutions;*algebraically*...##
###
Subject Index Volumes 1–200

2001
*
Discrete Mathematics
*

, see also 3-

doi:10.1016/s0012-365x(00)00471-4
fatcat:znxg54q6ifgutnhzj3urcw455y
*valued*function, 4686 three-*valued**Lukasiewicz**algebra*, 2385, 5732 propositional calculus, 2385 three-*valued**Lukasiewicz*-Moisil*algebra*, 1621, 1650 three-variegated, see also 3-variegated ... 891 θ -*valued**Lukasiewicz**algebra*, 891, 1094 Moisil field, 1094 ordered*Lukasiewicz*space, 991 Thibon, 5559 thick flag transitive geometry, 5392 geometry, 5392 line, 4741 thickness, 5600 minimal ... graph, see (n, k)-graph (n, n + 1)-factor, 5047 (n, n + 2)-graph, 5334, 5335 (n, n − 2)-tree decomposition, 5734 (n, q) graph, see (n, k)-graph n 2 -locally disconnected, 3848 Naddef, 3287 Nagell-Lutz*theorem*...##
###
The heavy path approach to Galton-Watson trees with an application to Apollonian networks
[article]

2017
*
arXiv
*
pre-print

As a consequence,

arXiv:1701.02527v1
fatcat:mmihsb3ninf7rbfv52hgcxppry
*for*uniformly random Apollonian networks of size n, the expected size of the longest simple path is Ω(n). ... In particular, under some moment condition, the 2-heavy tree is with high probability larger than cn*for*some constant c > 0, and the maximal distance from the k-heavy tree is O(n^1/(k+1)) in probability ... The authors would also like to thank Louigi Addario-Berry and Christina Goldschmidt*for*valuable discussions in particular regarding the arguments involved in the study of the heavy path. ...##
###
Relational similarity-based model of data part 1: foundations and query systems

2017
*
International Journal of General Systems
*

of

doi:10.1080/03081079.2017.1357550
fatcat:hnfdlhj7a5bcpkdmnvbvoz62aa
*values*and partial match of queries. ... We present fundamentals of the formal model and two equivalent query systems which are analogues of the classical relational*algebra*and domain relational calculus with range declarations. ...*for*L being the two-*valued*Boolean*algebra*but the converse does not hold since residuated lattices are more general structures. ...##
###
Page 1393 of Mathematical Reviews Vol. , Issue Index
[page]

*
Mathematical Reviews
*

Termination

*for*a class of algorithms*for*constructing*algebras*given by generators and relations. (English summary) Algorithms*for**algebra*(Eindhoven, 1996). J. Pure Appl. ... [*Lukasiewicz*and the*theorem*on contradiction: some comments and critical remarks] Stidamerikanische Beitrdge zur modernen Deutung der Aristotelischen Logik, 261-287, Mod. Deutung Aristot. ...##
###
Page 1466 of Mathematical Reviews Vol. 26, Issue Index
[page]

*
Mathematical Reviews
*

Wojciechowski
— (with Pelczynski, Aleksander) Molecular decompositions and embedding

*theorems**for*vector-*valued*Sobolev spaces with gradient norm. ...*Algebra*21 (1993), no. 11, 4013-4020. (Summary) 944:06044 06F25 rauch-Wojciechowski, Stefan see Rauch-Wojciechowski, Stefan Wéjcik, Adam P. Direct and inverse*theorems*of approximation theory. ...##
###
Page 463 of Mathematical Reviews Vol. , Issue Index
[page]

*
Mathematical Reviews
*

Unitary structure in

*representations*of infinite-dimensional groups and a convexity*theorem*. Invent. Math. 76 (1984), no. 1, 1-14. ... Lewis) 86g:49017b 49A36 (49B36) An axiomatization of the equivalential fragment of the three-*valued*logic of*Lukasiewicz*. Notre Dame J. Formal Logic 25 (1984), no. 4, 354-356. ...##
###
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks

2019
*
Electronic Journal of Probability
*

As a consequence,

doi:10.1214/19-ejp263
fatcat:sc3tmulb4ff73dl3nby4bogfau
*for*uniformly random Apollonian networks of size n, the expected size of the longest simple path is Ω(n). ... In particular, under some moment condition, the 2-heavy tree is with high probability larger than cn*for*some constant c > 0, and the maximal distance from the k-heavy tree is O(n 1/(k+1) ) in probability ... The authors also thank two anonymous referees*for*valuable comments. ...##
###
Logic and Linguistics in the Twentieth Century
[chapter]

2009
*
The Development of Modern Logic
*

argues

doi:10.1093/acprof:oso/9780195137316.003.0045
fatcat:4jsyv3ee3fgvjp7cd3axy76pwi
*for*the possibility of pursuing Davidson's program in semantics by giving a recursive definition of truth*for*natural language using as input the LF syntactic*representations*, as semantic*values*... by 'f') if and only if the first-level concept takes the*value*True*for*every object in the universe; otherwise it has the*value*False. ...##
###
Page 1114 of Mathematical Reviews Vol. 25, Issue Index
[page]

*
Mathematical Reviews
*

Kryakvin) 93¢:35026 35305 (35C15)
Savini, Sonia (with Monteiro, Luiz; Sewald, Julio) Construction of monadic three-

*valued**Lukasiewicz**algebras*.*Algebraic*logic. ... (David Joyner) 93f:22019 22E50 — On the tensor product of*theta**representations*of GL3. Pacific J. Math. 154 (1992), no. 2, 369-380. ...##
###
Page 1227 of Mathematical Reviews Vol. , Issue Index
[page]

*
Mathematical Reviews
*

Plancherel

*theorem**for*the universal cover of the conformal group. ... (See 88c:78001) 22E45*Representations*of the*algebra*sp(2,R). Lie methods in optics (Ledn, 1985), 239-247, Lecture Notes in Phys., 250, Springer, Berlin-New York, 1986. ...##
###
The puzzle of chaotic neurodynamics

2001
*
Behavioral and Brain Sciences
*

Skeleton network

doi:10.1017/s0140525x01240096
fatcat:gxbhb45wf5gmdjjd5usvs6ue4y
*for*dynamic associative memory. The network consists of two blocks, I and II. ... Grebogi's order in preserving "strange nonchaotic" attractor with fractal dimension but Lyapounov is suggested*for*neural network tasks dependent on sequence. ... We also thank Michael Breakspear and Karl Friston*for*kindly answering a basic question we asked them on the symmetry they used in their commentary, and Jaroslav Stark,*for*informing us of many related ...##
###
Toward an interpretation of dynamic neural activity in terms of chaotic dynamical systems

2001
*
Behavioral and Brain Sciences
*

Skeleton network

doi:10.1017/s0140525x01000097
fatcat:d2mpwqliqjdetnzhwbktezj4ka
*for*dynamic associative memory. The network consists of two blocks, I and II. ... Grebogi's order in preserving "strange nonchaotic" attractor with fractal dimension but Lyapounov is suggested*for*neural network tasks dependent on sequence. ... We also thank Michael Breakspear and Karl Friston*for*kindly answering a basic question we asked them on the symmetry they used in their commentary, and Jaroslav Stark,*for*informing us of many related ...
« Previous

*Showing results 1 — 15 out of 18 results*