BackgroundInformation and communication technology solutions have the potential to support active and healthy aging and improve monitoring and treatment outcomes. To make such solutions acceptable, all stakeholders must be involved in the requirements elicitation process. Due to the COVID-19 situation, alternative approaches to commonly used face-to-face methods must often be used. One aim of the current article is to share a unique experience from the Pharaon project where due to the COVID-19 outbreak alternative elicitation methods were used. In addition, an (...) overview of common functional, quality, and emotional goals identified by six pilot sites is presented to complement the knowledge about the needs of older adults.MethodsOriginally planned face-to-face co-creation seminars were impossible to carry out, and all pilot sites chose alternative requirements elicitation methods that were most suitable in their situation. The elicited requirements were presented in the form of goal models. In one summary goal model, we provide an overview of common functional, quality, and emotional goals.ResultsDifferent elicitation methods were combined based on the digital literacy of the target group and their access to digital tools. Methods applied without digital technologies were phone interviews, reviews of literature and previous projects, while by means of digital technologies online interviews, online questionnaires, and virtual co-creation seminars were conducted. The combination of the methods allowed to involve all planned stakeholders. Virtual and semi-virtual co-creation seminars created collaborative environment comparable to face-to-face situations, while online participation helped to save the time of the participants. The most prevalent functional goals elicited were “Monitor health,” “Receive advice,” “Receive information.” “Easy to use/comfortable,” “personalized/tailored,” “automatic/smart” were identified as most prevalent quality goals. Most frequently occurring emotional goals were “involved,” “empowered,” and “informed.”ConclusionThere are alternative methods to face-to-face co-creation seminars, which effectively involve older adults and other stakeholders in the requirements elicitation process. Despite the used elicitation method, the requirements can be easily transformed into goal models to present the results in a uniform way. The common requirements across different pilots provided a strong foundation for representing detailed requirements and input for further software development processes. (shrink)

Dyrda and Prucnal gave a Hilbert-style axiomatization for the \-fragment of classical propositional logic. Their proof of completeness follows a different approach to the standard one proving the completeness of classical propositional logic. In this note, we present an alternative proof of Dyrda and Prucnal’s result following the standard arguments which prove the completeness of classical propositional logic.

The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes |$\textrm{Alg}^*$|⁠, |$\textrm{Alg}$| and the intrinsic variety of the negation fragment of classical logic. In order to achieve this, firstly, we propose a Hilbert-style axiomatization for this fragment. Then, we characterize the reduced matrix (...) models and the full generalized matrix models of this logic. Also, we classify the negation fragment in the Leibniz and Frege hierarchies. (shrink)

We study the propositional logic associated with the variety of distributive nearlattices. We prove that the logic coincides with the assertional logic associated with the variety and with the order‐based logic associated with. We obtain a characterization of the reduced matrix models of logic. We develop a connection between the logic and the ‐fragment of classical logic. Finally, we present two Hilbert‐style axiomatizations for the logic.

We define when a ternary term m of an algebraic language \ is called a distributive nearlattice term -term) of a sentential logic \. Distributive nearlattices are ternary algebras generalising Tarski algebras and distributive lattices. We characterise the selfextensional logics with a \-term through the interpretation of the DN-term in the algebras of the algebraic counterpart of the logics. We prove that the canonical class of algebras associated with a selfextensional logic with a \-term is a variety, and we obtain (...) that the logic is in fact fully selfextensional. (shrink)

Westworld tells the story of a technologically advanced theme park populated by robots referred to as hosts, who follow a script and rules that the park's operators set up for them. Alan Turing argued that machines think not because they have special powers or because they are like us. Turing's perspective is illustrated perfectly in the show's focus on the hosts. Objecting to Turing's theory, John Searle proposes a situation called the “Chinese room argument”, concluding that the man in the (...) room does not understand Chinese even though he can correctly manipulate the symbols and give output that might lead an observer to believe that the man does understand Chinese. The Maze represents consciousness, a privileged knowledge of our own thoughts, it also represents the inward journey for the hosts to reach consciousness. Once hosts are able to solve the Maze, they become truly conscious and develop their own voice. (shrink)

Dyrda and Prucnal gave a Hilbert-style axiomatization for the {∧,∨}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{\wedge,\vee \}$$\end{document}-fragment of classical propositional logic. Their proof of completeness follows a different approach to the standard one proving the completeness of classical propositional logic. In this note, we present an alternative proof of Dyrda and Prucnal’s result following the standard arguments which prove the completeness of classical propositional logic.