Recent landscape studies have shifted focus from the formal aesthetics of garden design to embodied behavioral experiences. While much of the literature has centered on the artistic principles of traditional garden design, limited attention has been paid to the underlying design philosophy of commercial gardens. Drawing on cognitive map theory and employing a non-participatory observation method, this study examines the experiential patterns and Human Environment Interaction (HEI) design logic within Panxi (PGR) and South Garden Restaurants (SGR), and proposes a landscape narrative model grounded in the “sensory – behavioral – memory” triadic structure. PGR demonstrates an open, socially interactive spatial configuration characterized by the synergy of multiple nodes, whereas SGR establishes immersive experiential zones anchored around focal landscapes. Lingnan garden architecture (GA) constructs spatial imagery through a four-element system of “edges, landscape, architecture, paths”. In both gardens, short-duration, high-frequency dwellings occur at nodes such as zigzag bridges, covered corridors, and spiral staircases. Elderly visitors tend to favor tranquil districts, while younger cohorts are drawn to zones with high informational density. Individuals’ perception of garden spaces is shaped not only by immediate sensory stimuli but also by structurally embedded memory and lived experience.
Matthias Baaz, Mariami Gamsakhurdia, Rosalie Iemhoff
et al.
Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifiers by introducing new function symbols, enabling efficient proof search algorithms. We characterize intermediate first-order logics that admit standard (and Andrews) Skolemization. These are the logics that allow classical quantifier shift principles. For some logics not in this category, innovative forms of Skolem functions are developed that allow Skolemization. Moreover, we analyze predicate intuitionistic logic with quantifier shift axioms and demonstrate its Kripke frame-incompleteness. These findings may foster resolution-based theorem provers for non-classical logics. This article is part of a larger project investigating Skolemization in non-classical logics.
Unbounded Łukasiewicz logic is a substructural logic that combines features of infinite-valued Łukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals expanded with a distinguished element $-1$. We show that the existential theory of this structure is NP-complete. This provides a complexity upper bound for the set of theorems and the finite consequence relation of unbounded Łukasiewicz logic. The result is obtained by reducing the problem to the existential theory of the MV-algebra on the reals, the standard semantics of Łukasiewicz logic. This provides a new connection between both logics. The result entails a translation of the existential theory of the standard MV-algebra into itself.
Andrea De Domenico, Ali Farjami, Krishna Manoorkar
et al.
We further develop the abstract algebraic logic approach to input/output logic initiated in \cite{wollic22}, where the family of selfextensional logics was proposed as a general background environment for input/output logics. In this paper, we introduce and discuss the generalizations of several types of permission (negative, dual negative, static, dynamic), as well as their interactions with normative systems, to various families of selfextensional logics, thereby proposing a systematic approach to the definition of normative and permission systems on nonclassical propositional bases.
Game Logic with sabotage ($\mathsf{GL_s}$) is introduced as a simple and natural extension of Parikh's game logic with a single additional primitive, which allows players to lay traps for the opponent. $\mathsf{GL_s}$ can be used to model infinite sabotage games, in which players can change the rules during game play. In contrast to game logic, which is strictly less expressive, $\mathsf{GL_s}$ is exactly as expressive as the modal $μ$-calculus. This reveals a close connection between the entangled nested recursion inherent in modal fixpoint logics and adversarial dynamic rule changes characteristic for sabotage games. A natural Hilbert-style proof calculus for $\mathsf{GL_s}$ is presented and proved complete using syntactic equiexpressiveness reductions. The completeness of a simple extension of Parikh's calculus for game logic follows.
Path planning in complex environments remains a challenging task for unmanned vehicles. In this paper, we propose a decoupled path-planning algorithm with the help of a deep reinforcement learning algorithm that separates the evaluation of paths from the planning algorithm to facilitate unmanned vehicles in real-time consideration of environmental factors. We use a 3D surface map to represent the path cost, where the elevation information represents the integrated cost. The peaks function simulates the path cost, which is processed and used as the algorithm’s input. Furthermore, we improved the double deep Q-learning algorithm (DDQL), called retrospective-double DDQL (R-DDQL), to improve the algorithm’s performance. R-DDQL utilizes global information and incorporates a retrospective mechanism that employs fuzzy logic to evaluate the quality of selected actions and identify better states for inclusion in the memory. Our simulation studies show that the proposed R-DDQL algorithm has better training speed and stability compared to the deep Q-learning algorithm and double deep Q-learning algorithm. We demonstrate the effectiveness of the R-DDQL algorithm under both static and dynamic tasks.
This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. The full source code can be found online at https://github.com/bbentzen/ipl.
We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason with eigenworlds (i.e., generic representatives of worlds) in an arbitrary model. This reasoning is captured by a sequent calculus for a meta-logic (in this case, first-order classical logic) expressive enough to capture the semantics of the object-logic. Essentially, one has a calculus of validity for the object-logic. The method proceeds through the perspective of reductive logic (as opposed to the more traditional paradigm of deductive logic), using the space of reductions as a medium for showing the behavioural equivalence of reduction in the sequent calculus for the object-logic and in the validity calculus. Rather than study the technique in general, we illustrate it for the logic of Bunched Implications (BI), thus IPL and MILL (without negation) are also treated. Intuitively, BI is the free combination of intuitionistic propositional logic and multiplicative intuitionistic linear logic, which renders its meta-theory is quite complex. The literature on BI contains many similar, but ultimately different, algebraic structures and satisfaction relations that either capture only fragments of the logic (albeit large ones) or have complex clauses for certain connectives (e.g., Beth's clause for disjunction instead of Kripke's). It is this complexity that motivates us to use BI as a case-study for this approach to semantics.
We provide characterization of the strong termination property of the CCV
(complete call-by-value) lambda-mu calculus introduced in the first part of
this series of the paper. The calculus is complete with respect to the standard
continuation-passing style (CPS) semantics. The union-intersection type systems
for the calculus is developed in the previous paper. We characterize the strong
normalizability of terms of the calculus in terms of the CPS semantics and
typeability.
Eduardo Luciano Hernández Ramos, Francisco Alejo Guanoluisa Almache, Alba Rosa Pupo Kairuz
et al.
Legal sciences are the theoretical body of law. This branch of knowledge studies the rules and principles that govern the correct functioning of society. The proper administration of justice is essential for the satisfaction of the subjective and objective needs of citizens. It ensures that members of society fulfill their duties and can satisfy their rights before their families and other citizens. The purpose of this paper is the presentation of a neutrosophy-based model for representing decision-making within a trial, specifically concerning both, the sufficient proof and weighing of pieces of evidence. Concepts based on the neutrosophic measure are used to enrich an earlier model that used subjective logic. We follow the principle that neutrosophic theory allows for greater precision in legal reasoning because it makes it possible to explicitly differentiate and evaluate which parts are determined and known and which parts are indeterminate and unknown. Keeping in mind that a trial is plagued with unknown, imprecise, confusing, contradictory, and paradoxical elements; and these are the ones that must be clarified with proofs and pieces of evidence. This model can be the basis of a Decision Support System or an Expert System.
Sajad Shafiekhani, Arash Poursheykhani, Sara Rahbar
et al.
Background: Interactions of many key proteins or genes in signalling pathway have been studied qualitatively in the literature, but only little quantitative information is available. Objective: Although much has been done to clarify the biochemistry of transcriptional dynamics in signalling pathway, it remains difficult to find out and predict quantitative responses. The aim of this study is to construct a computational model of epidermal growth factor receptor (EGFR) signalling pathway as one of hallmarks of cancer so as to predict quantitative responses. Material and Methods: In this analytical study, we presented a computational model to investigate EGFR signalling pathway. Interaction of Arsenic trioxide (ATO) with EGFR signalling pathway factors has been elicited by systematic search in data bases, as ATO is one of the mysterious chemotherapy agents that control EGFR expression in cancer. ATO has dichotomous manner in vivo, dependent on its concentration. According to fuzzy rules based upon qualitative knowledge and Petri Net, we can construct a quantitative model to describe ATO mechanism in EGFR signalling pathway. Results: By Fuzzy Logic models that have the potential to trade with the loss of quantitative information on how different species interact, along with Petri net quantitatively describe the dynamics of EGFR signalling pathway. By this model the dynamic of different factors in EGFR signalling pathway is achieved. Conclusion: The use of Fuzzy Logic and PNs in biological network modelling causes a deeper understanding and comprehensive analysis of the biological networks.
Medical physics. Medical radiology. Nuclear medicine
Industry 4.0 allows for greater flexibility in production processes so that products can be customized (i.e., mass customization). Innovative production techniques in an industrial liquid/yogurt filling machine (YFM) improved efficiency in the beverage industry. In this study, we have introduced the second phase designed control architecture of our YFM based on the concepts of industry 4.0 incorporating an NFC platform for improving customer satisfaction. Especially during this pandemic period, wireless technologies have been ubiquitous and pervasive for customized products. The basic components of the YFM have been described. High-level control architecture programmed fully automated filling operations, and the design stage of the development of a PFC-based controller for the YFM is elaborated. For the evaluation of the proposed control system, the operations of the electric/pneumatic input devices and actuators were simulated on FluidSIM-MecLab. The results of the simulation verify the design logic of the PFC-based controller. Comparisons were made between different production types using the developing YFM. A complex learning environment replicating a real production system to understand, learn, and apply modern manufacturing approaches has been developed. Through the creation of this YFM, the academic environment and industrial applications are combined. Consequently, the problem verification is becoming more realistic and more efficient than online (trial and error) automation programming.
We discuss about how to make a new logic with considering a slogan: \it take the inversion of what you know. \rm Suppose that we have a Gentzen-style logical system $S$. The operation to make a new logic from $S$ is the following: \it for all the axioms and rules of $S$, change the direction of all the arrows occurred in the sequents of the axiom or the rule to the opposite side. \rm We call this operation \it Stahlization. \rm We consider certain logics in this respect.
The United States and Turkey have been bound by strong ties of strategic partnership for decades since the dawn of the Cold War. However, the relationship between two NATO allies have become quite strained over the recent years. The root causes of the current contradictions between Ankara and Washington manifested themselves clearly at the beginning of the Obama presidency. This paper examines the reasons behind and the nature of the difficulties that the U.S. and Turkey would confront in 2009–2010 while trying to implement the concept of ‘model partnership’ introduced by the Democratic administration. In particular, it assesses the extent to which the transformation of the Turkish foreign policy strategy modified the logic of its interaction with Washington and reinforced Ankara’s desire to have its national interests recognized and respected by the United States. The differences between the U.S. and Turkish positions are illustrated with the examples of their contradictions about interaction with Israel and Iran. The author demonstrates that various methods of persuasion and coercion practiced by the Obama administration were not necessarily effective and their use led to a deterioration of situation on several occasions. The author also provides a detailed overview of the debates on the prospects of the bilateral cooperation and the foreign policy identity of modern Turkey that took place in the U.S. political and academic circles at that time. The paper also determines the main factors behind a rapprochement of two countries following a temporary estrangement. The conclusion is drawn that a further escalation of tensions was prevented mainly because security factor played a predominant role. The U.S.-Turkish military-strategic cooperation within NATO remained — regardless of divergences on several regional issues and political scandals — the cornerstone of the bilateral relationship. The U.S.-Turkish partnership, though not a model one, passed an endurance test only to face even more complex challenges related to a destabilization of a broader region in the wake of the Arab Awakening.
The objectives of the study were (1) to produce PLC-based Electrical Machine Practice learning media (2) to determine the performance of PLC-based Electrical Machine Practice learning media products and (3) to determine the feasibility level of PLC-based Electrical Machine Practice learning media products. This study was Research and Development which refers to the ADDIE model according to Branch. The stages in this study include analysis, design, development, implementation, and evaluation. Data collection methods used in this study were interviews, observations, and questionnaires. The instruments used in the study were the observation sheet and questionnaires. The results of this study indicated: (1) the product of learning media for Electrical Machine Practice based on PLC Schneider SR2B201FU; (2) the product of PLC-based Electrical Machine Practice learning media has good performance; (3) the product of PLC-based Electrical Machine Practice learning media has eligibility in the very feasible category to be used in learning, which is supported by the acquisition of a consecutive score of 3.65; 3.58 and 3.58 on a 4.0 scale according to the validation of material experts, media experts, and students.
Christoph Benzmüller, Ali Farjami, David Fuenmayor
et al.
The LogiKEy workbench and dataset for ethical and legal reasoning is presented. This workbench simultaneously supports development, experimentation, assessment and deployment of formal logics and ethical and legal theories at different conceptual layers. More concretely, it comprises, in form of a dataset (Isabelle/HOL theory files), formal encodings of multiple deontic logics, logic combinations, deontic paradoxes and normative theories in the higher-order proof assistant system Isabelle/HOL. The data were acquired through application of the LogiKEy methodology, which supports experimentation with different normative theories, in different application scenarios, and which is not tied to specific logics or logic combinations. Our workbench consolidates related research contributions of the authors and it may serve as a starting point for further studies and experiments in flexible and expressive ethical and legal reasoning. It may also support hands-on teaching of non-trivial logic formalisms in lecture courses and tutorials.The LogiKEy methodology and framework is discussed in more detail in the companion research article titled “Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support” [5].
Computer applications to medicine. Medical informatics, Science (General)