Results 21 to 30 of about 124,240 (288)
The concept of «suffering» in Buddhism: ontological problematics
Sententiae, 2022 Unlike the most common in the modern studies – the psychological, ethical, socio-cultural – approaches to the problem of suffering, in this paper the philosophical problematics of ontological dimension of the suffering in the Buddhist philosophy is ...
Anastasia Strelkova
doaj +1 more source
Large distance asymptotic behavior of the emptiness formation probability of the XXZ spin-1/2 Heisenberg chain [PDF]
, 2002 Using its multiple integral representation, we compute the large distance asymptotic behavior of the emptiness formation probability of the XXZ spin-1/2 Heisenberg chain in the massless regime.Comment: LPENSL-TH-10, 8 ...
Boos H E +11 more
core +4 more sources
MOTIV EMPTINESS IN NOVEL V.O. PELEVIN’S NOVEL “CHAPAYEV AND PUSTOTA”
RUDN Journal of Studies in Literature and Journalism, 2017 The task of this article is to reveal the motive of emptiness in V. Pelevin’s novel “Chapaev and Void”.We consider the philosophical basis of the concept of emptiness in the artistic picture of the novel’s world, the origins of which date back to eastern
A B Seydashova
doaj +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Dimino, Jerémie +2 more
core +5 more sources
Efficient Emptiness Check for Timed B\"uchi Automata (Extended version) [PDF]
, 2010 The B\"uchi non-emptiness problem for timed automata refers to deciding if a given automaton has an infinite non-Zeno run satisfying the B\"uchi accepting condition. The standard solution to this problem involves adding an auxiliary clock to take care of
B Berthomieu +25 more
core +6 more sources
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
, 2018 We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem but has an undecidable emptiness problem.
Ibarra, Oscar H., McQuillan, Ian
core +1 more source
Trans/Form/AçãoTang Junyi’s The objective of this study is to thoroughly analyze and interpret Tang Junyi’s ideas about emptiness and substance in literature and art in a systematic manner.
Hongqin Yu
doaj +1 more source
Weak MSO+U with Path Quantifiers over Infinite Trees
, 2014 This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths.
M. Bojańczyk +10 more
core +1 more source
Parametric LTL on Markov Chains [PDF]
, 2014 This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains variables; e.g., $\Diamond_{\le x}\ \varphi$ asserts that $\varphi$ holds ...
A. Puggelli +14 more
core +1 more source
Alternating, private alternating, and quantum alternating realtime automata
, 2019 We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable.
Demirci, Gökalp +4 more
core +1 more source