Search

We introduce a basic intuitionistic conditional logic IntCK that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that IntCK stands in a very natural relation to other similar logics, like the basic classical conditional logic CK and the basic intuitionistic modal logic IK . As for the basic intuitionistic conditional logic ICK proposed in Weiss (Journal of Philosophical Logic, 48, 447–469, 2019), IntCK extends its language with a diamond-like conditional modality ◊ → , but its ( ◊ → )-free fragment is also a proper extension of ICK . We briefly discuss the resulting gap between the two candidate systems of basic intuitionistic conditional logic and the possible pros and cons of both candidates. [ABSTRACT FROM AUTHOR]

In this paper, we investigate an overdamped bistable system subject to Gaussian white noise and logical inputs. By solving and estimating the steady distribution of the corresponding Fokker–Planck equation and considering the two essential features of the reliable logic operations (RLOs)—initial value independence and sign invariance—we establish the sufficient condition for RLO occurrence and identify parametric resonance phenomena in the system. Our numerical simulations confirm the reliability and accuracy of the theoretical results. This work offers insights into enhancing the accuracy of stochastic systems, particularly in the realm of logical stochastic resonance, thereby contributing to advancements in understanding and controlling stochastic dynamical systems. [ABSTRACT FROM AUTHOR]

This paper explores the connective 'because', based on the idea that 'C because A' implies the acceptance/truth of the antecedent A as well as of the consequent C, and additionally that the antecedent makes a difference for the consequent. To capture this idea of difference-making a 'relevantized' version of the Ramsey Test for conditionals is employed that takes the antecedent to be relevant to the consequent in the following sense: a conditional is true/accepted in a state σ just in case (i) the consequent is true/accepted when σ is revised by the antecedent and (ii) the consequent fails to be true/accepted when σ is revised by the antecedent's negation. To extend this to a semantics for 'because', we add that (iii) the antecedent and (iv) the consequent are accepted/true in the state σ . We get metaphysical or doxastic interpretations of these clauses, depending on what we mean by a model and a state. We introduce several semantics known from suppositional conditionals, which we reinterpret for difference-making conditionals and 'because'. We present a minimal logic for 'because' sentences and show how it can be extended in ways that parallel the hierarchy of extensions of the logic of suppositional conditionals. We establish correspondence results between axioms for 'because' and properties of states, and prove that the specified logics are sound with respect to the semantics. [ABSTRACT FROM AUTHOR]

Recent years have seen increasing interest in interventionist analyses of metaphysical explanation. One area where interventionism traditionally shines, is in providing an account of explanatory depth; the sense in which explanation comes in degrees. However, the literature on metaphysical explanation has left the notion depth almost entirely unexplored. In this paper I shall attempt to rectify this oversight by motivating an interventionist analysis of metaphysical explanatory depth (MED), in terms of the range of interventions under which a metaphysically explanatory generalization remains invariant. After elucidating the notion through a toy-example, I demonstrate the important work which MED can perform in characterizing debate within contemporary metaphysics. Focusing upon rival approaches to explaining the identity and distinctness of concrete objects, I argue that the progress achieved in this debate can be characterized in terms of increasing explanatory depth. Having made an initial case for the utility of MED, I then turn this analysis to the metaphysics of explanation itself. By adopting an interventionist framework with respect to MED, I will show that we can assess the depth of competing theories of explanation. This application has two interesting results: first, it suggests that an interventionist analysis of explanation provides deeper explanations of the connection between explanans and explanandum than rival accounts; and second, it suggests that explanations provided by interventionism become deeper still, if one accepts that this methodology ranges over metaphysical, as well as causal, instances. [ABSTRACT FROM AUTHOR]

This paper introduces a novel fuzzy logic switched model predictive control (MPC) algorithm for articulated steering vehicles, addressing significant path tracking challenges due to varying road conditions and vehicle speeds. Traditional single-model and parameter-based controllers struggle with tracking errors and computational inefficiencies under diverse operational conditions. Therefore, a kinematics-based MPC algorithm is first developed, showing strong real-time performance but encountering accuracy issues on low-adhesion surfaces and at high speeds. Then, a 4-DOF dynamics-based MPC algorithm is designed to enhance tracking accuracy and control stability. The proposed solution is a switched MPC strategy, integrating a fuzzy control system that dynamically switches between kinematics-based and dynamics-based MPC algorithms based on error, solution time, and heading angle indicators. Subsequently, simulation tests are conducted using SIMULINK and ADAMS to verify the performance of the proposed algorithm. The results confirm that this fuzzy-based MPC algorithm can effectively mitigate the drawbacks of single-model approaches, ensuring precise, stable, and efficient path tracking across diverse adhesion road conditions. [ABSTRACT FROM AUTHOR]

It can often seem like the attitude we hold towards a conditional should be our attitude in the consequent on the supposition of the antecedent. Following by Williamson (Suppose and Tell: The Semantics and Heuristics of Conditionals. Oxford University Press, 2020), we call this The suppositional rule (SR). The Adams-style non-propositional theories of indicatives upholds some key implications of SR, allowing, for instance, our credence in a conditional to be the probability of the consequent given the antecedent. Williamson (Suppose and Tell: The Semantics and Heuristics of Conditionals. Oxford University Press, 2020) has recently provided a series of inconsistency arguments against SR. He thereby intends to undermine non-propositional views as well as other rivals to his favoured material conditional account. I outline a strategy which theorists of all stripes can employ to avoid Williamson's arguments. I then show how non-propositionalists can implement this strategy. I show how they can uphold SR when it is intuitively compelling, whilst allowing it to fail when it is not. [ABSTRACT FROM AUTHOR]

This work presents the detailed design of a Successive Approximation Analog to Digital Data Converter (SAR ADC) using bulk 180 nm CMOS IC technology. The focus of the study is on replacing the typical Successive Approximation Register array with a Finite State Machine. This converter features a fully differential and bipolar architecture, which leads to the logic SAR nonlinear behavior. A novel digital control logic mitigates the conversion errors through the conditions in the previous logic states. The logic scheme, in combination with a robust continuous comparator, demonstrates tolerance to Process, Voltage, and Temperature variations. The architecture does not include calibration or additional redundancies in post-layout simulations to emphasize the exclusive benefits of the new SAR logic. The proposed SAR ADC achieves a 14.07 effective number of bits with 7.04 fJ/conversion step Walden figure of merit in biomedical applications. [ABSTRACT FROM AUTHOR]

We show that there is a simple derivation of triviality with very few assumptions involving the formula that the negated conditional entails the antecedent of the conditional. [ABSTRACT FROM AUTHOR]

The standard semantics for modality, together with the influential restrictor analysis of conditionals (Kratzer, 1986, 2012) renders conditional ought claims like "If John's stealing, he ought to be stealing" trivially true. While this might seem like a problem specifically for the restrictor analysis, the issue is far more general. Any account must predict that modals in the consequent of a conditional sometimes receive obligatorily unrestricted interpretation, as in the example above, but sometimes appear restricted, as in, e.g., "If John's speeding, he ought to pay the fine." And the problem runs deeper, for there are non-conditional variants of the data. Thus, the solution cannot lie in adopting a particular analysis of conditionals, nor a specific account of the interaction between conditionals and modals. Indeed, with minimal assumptions, the standard account of modality will render a myriad of claims about what one ought to, must, or may, do trivially true. Worse, the problem extends to a wide range of non-deontic modalities, including metaphysical modality. But the disaster has a remedy. I argue that the source of the problem for the standard account lies in its failure to capture an inferential evidence constraint encoded in the meaning of a wide range of modal constructions. I offer an account that captures this constraint, and show it provides a general and independently motivated solution to the problem. [ABSTRACT FROM AUTHOR]

The article "Linking Structures Across Logic and Space: The Role of Euler Diagrams" discusses the use of Euler diagrams as a tool to aid students in understanding logical implications. The authors argue that Euler diagrams can be helpful in visualizing logical relationships and establishing the validity of statements. They introduce the concept of logico-spatial linked structuring (LSLS) as a framework for understanding how students connect spatial and non-spatial representations when dealing with logical statements. The article provides examples of LSLS in student reasoning and highlights the different ways students spatially represent logical implications using Euler diagrams. The text emphasizes the importance of bridging the gap between math educators and professional mathematicians and acknowledges the contributions of Uri Leron to mathematics education and proof research. [Extracted from the article]

The article focuses on responding to Grano et al.'s exploration of irrealis expressions in Lutuv, particularly concerning the nuances of modal-temporal interpretations involving necessity and possibility across different temporal domains. Topics include a detailed analysis of the Lutuv marker "-aa" and its potential references to actual and counterfactual indices, questioning whether it qualifies as an irrealis marker.

This paper examines the logic of conditional obligation, which originates from the works of Hansson, Lewis, and others. Some weakened forms of transitivity of the betterness relation are studied. These are quasi-transitivity, Suzumura consistency, acyclicity and the interval order condition. The first three do not change the logic. The axiomatic system is the same whether or not they are introduced. This holds true under a rule of interpretation in terms of maximality and strong maximality. The interval order condition gives rise to a new axiom. Depending on the rule of interpretation, this one changes. With the rule of maximality, one obtains the principle known as disjunctive rationality. With the rule of strong maximality, one obtains the Spohn axiom (also known as the principle of rational monotony, or Lewis' axiom CV). A completeness theorem further substantiates these observations. For interval order, this yields the finite model property and decidability of the calculus. [ABSTRACT FROM AUTHOR]

This study shows that the Turkish expression hani exhibits interesting properties for the study of the semantics and pragmatics interface, because, on the one hand, its function is merely pragmatic, but on the other hand, it is subject to the truth-conditional effect of other constituents at LF. This notwithstanding, studies on this expression are remarkably scarce. The only attempts to describe its properties are Erguvanlı-Taylan (Studies on Turkish and Turkic languages; proceedings of the ninth international conference on Turkish linguistics, 133–143, 2000), Akar et al. (Discourse meaning, 57–78, 2020), and Akar and Öztürk (Information-structural perspectives on discourse particles, 251–276, 2020). In the present study, we introduce the first formal semantic and pragmatic treatment of clauses containing hani. Unlike previous accounts, we claim that hani can have one of the following two major pragmatic functions: making salient a proposition in the Common Ground or challenging one in a past Common Ground, therefore requiring a Common Ground revision. Despite its variety of occurrences, we argue that hani has a uniform interpretation and provide a compositional analysis of the different construals that it is associated with. Furthermore, we show that a formally explicit and accurate characterization of hani clauses requires operating on indexical parameters, in particular the context time. Therefore, if our proposal is on the right track, hani clauses may provide indirect empirical evidence in favour of the existence of "monstrous" phenomena, adding to the accumulating cross-linguistic evidence in this domain (see Schlenker in Linguistics and Philosophy 26(1):29–120, 2003 and much work since then). The definition of monsters is intended as in Kaplan (Themes from Kaplan, 481–563, 1989). [ABSTRACT FROM AUTHOR]

This study focusses on non-adverbial uses of lá in European Portuguese, whose exact meaning contribution still remains an open research question. Applying a multidimensional semantics framework, the central claim is that non-adverbial uses of lá represent use-conditional items. Passing the standard tests suggested in the literature, they thus do not contribute to the truth conditions of an utterance but specify particular use conditions. It is argued that they are felicitously used if a speaker wants to convey illocutionary modification, which pragmatically leads to mitigation or reinforcement effects. Diachronically, substantiated by historical data from the Corpus do Português, use-conditional lá is argued to be a product of a pragmaticalization process that led to so-called pragmatic fission at some point, i.e., to the polysemy of two synchronically available configurations of a truth-conditional and a use-conditional lá. [ABSTRACT FROM AUTHOR]

Technological advancement and economic progress have made power consumption a big issue. Concern is growing as traditional energy sources dwindle. In the future, numerous fossil fuels will be insufficient to satisfy human requirements. This motivates research into the feasibility of using renewable energy sources. Renewable energy sources offer a multitude of advantages, including their cost-effectiveness, lack of environmental impact, and sustainable nature. Sunlight is currently the most prevalent source of energy because it is both free and readily accessible. Consequently, photovoltaic (PV) energy is gaining importance in the field of electricity generation. Tracking the maximum power point (MPP) in a solar PV system is challenging due to varying meteorological conditions (irradiance and temperature). To maximise the efficiency of a solar power installation, it is essential to monitor the PV array's optimum power point. This analysis compares the perturb and observe (P&O), fuzzy logic (FL), and suggested artificial neural network (ANN)-fuzzy strategy for determining the MPP of a PV system with minimal radiation exposure. Simulation results show that at low irradiation levels, the proposed ANN-fuzzy maximum power point tracking (MPPT) unit controller is superior to the FL and P&O MPPT controllers in terms of tracking maximum power. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to reveal the characteristics of the X ie imperative expression (abbreviated to X ie) with reference to other related expressions, such as conditional imperatives and past imperatives, in Japanese and other languages. Three criteria are proposed for a description of imperatives in terms of the realization of the propositional content: (i) possibility of realization, (ii) attitude toward realization, and (iii) preparedness for realization. X ie is an imperative of a reproof, characterized by the unique combination of (i) possible, (ii) negative, and (iii) unprepared. This paper further focuses on a discourse-pragmatic relation of the expression with its preceding and following utterances, a topic not fully discussed in the literature. The analysis in this paper shows that X ie is a marked imperative form of a verb of speech that expresses the speaker's instantaneous reaction to newly obtained information, i.e., the addressee's violation of the maxim of quality. This characterization suggests that the Japanese language is sufficiently sensitive to the violation to lexicalize it and that X ie can be considered in terms of mirativity. Finally, this paper systematically compares X ie and non-directive imperatives from other languages. [ABSTRACT FROM AUTHOR]

In this paper, Δ conditional randomized truth degree of propositional formula is put forward in Gödel n-valued propositional logic system. It adds Δ operator compared with conditional randomized truth degree. On this basis, some inference rules such as MP, HS, intersection inference, union inference and their related properties are studied. At last, the concepts of Δ conditional randomized similarity degree, Δ conditional randomized pseudo-metric between propositional formulas are given, and their related good properties are discussed. [ABSTRACT FROM AUTHOR]

The Meno problem, asking for the surplus value of knowledge beyond the value of true justified belief, was recently much treated within reliabilist and virtue epistemologies. The answers from formal epistemology, by contrast, are quite poor. This paper attempts to improve the score of formal epistemology by precisely explicating Timothy Williamson's suggestion that 'present knowledge is less vulnerable than mere present true belief to rational undermining by future evidence'. It does so by combining Nozick's sensitivity analysis of knowledge with Spohn's fact‐asserting epistemic interpretation of conditionals. Accordingly, the surplus value of knowledge lies in a specific kind of stability of knowledge, which differs, though, from that claimed by other so‐called stability analyses of knowledge. [ABSTRACT FROM AUTHOR]

We introduce a conceptual foundation for nonmonotonic reasoning which integrates an intuitionistic plurimodal logic with classical logic. The need for a multilogical system arises once we understand that to legitimately infer less than certain conclusions, we make two different kinds of assessments: an external one (what are the alternatives) and an internal one (which logic should govern the set of beliefs). We exploit this scheme to capture in novel ways basic nonmonotonic systems such as autoepistemic logic, default logic, one of the best known interpretations of negation-as-failure , as well as some conditional logics of normality. Among the aims of this paper is to explain why there are substantial overlaps between these systems and also to settle some problematic features that are of concern in logical investigations on common sense reasoning. [ABSTRACT FROM AUTHOR]

Many tasks in statistical and causal inference can be construed as problems of entailment in a suitable formal language. We ask whether those problems are more difficult, from a computational perspective, for causal probabilistic languages than for pure probabilistic (or "associational") languages. Despite several senses in which causal reasoning is indeed more complex—both expressively and inferentially—we show that causal entailment (or satisfiability) problems can be systematically and robustly reduced to purely probabilistic problems. Thus there is no jump in computational complexity. Along the way we answer several open problems concerning the complexity of well-known probability logics, in particular demonstrating the ${\exists \mathbb {R}}$ -completeness of a polynomial probability calculus, as well as a seemingly much simpler system, the logic of comparative conditional probability. [ABSTRACT FROM AUTHOR]

In this paper, a general idea of Presic type L-fuzzy fixed point results using some weakly contractive conditions in the setting of metric space is initiated. Stability of L-fuzzy mappings and associated new concepts are proposed herein to complement their corresponding notions related to crisp multi-valued and single-valued mappings. Illustrative nontrivial examples are provided to support the assertions of our main results. [ABSTRACT FROM AUTHOR]

This paper concerns the semantics of coordinated if-clauses, as in (1)-(2). It is argued that the meanings of such sentences are explained straightforwardly on theories of conditionals that tie their non- monotonic behaviour to the if-clause itself (e.g. Schlenker 2004, but not theories that tie it to a (covert) modal operator (e.g. Kratzer 1981; 1991). Coordinated if-clauses are revealing of the fine-grained compositional semantics of conditionals. [ABSTRACT FROM AUTHOR]

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. p ⇒ q is thus defined as ¬ ◊ (p ∧ ¬ q) ∧ ◊ p ∧ ◊ ¬ q . We explore the logical properties of this conditional in a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle's theses and weak Boethius' thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut. [ABSTRACT FROM AUTHOR]

The current development of logic satisfiability in discrete Hopfield neural networks (DHNN)has been segregated into systematic logic and non-systematic logic. Most of the research tends to improve non-systematic logical rules to various extents, such as introducing the ratio of a negative literal and a flexible hybrid logical structure that combines systematic and non-systematic structures. However, the existing non-systematic logical rule exhibited a drawback concerning the impact of negative literal within the logical structure. Therefore, this paper presented a novel class of non-systematic logic called conditional random k satisfiability for k=1,2 while intentionally disregarding both positive literals in second-order clauses. The proposed logic was embedded into the discrete Hopfield neural network with the ultimate goal of minimizing the cost function. Moreover, a novel non-monotonic Smish activation function has been introduced with the aim of enhancing the quality of the final neuronal state. The performance of the proposed logic with new activation function was compared with other state of the art logical rules in conjunction with five different types of activation functions. Based on the findings, the proposed logic has obtained a lower learning error, with the highest total neuron variation TV=857 and lowest average of Jaccard index, JSI=0.5802. On top of that, the Smish activation function highlights its capability in the DHNN based on the result ratio of improvement Zm and TV. The ratio of improvement for Smish is consistently the highest throughout all the types of activation function, showing that Smish outperforms other types of activation functions in terms of Zm and TV. This new development of logical rule with the non-monotonic Smish activation function presents an alternative strategy to the logic mining technique. This finding will be of particular interest especially to the research areas of artificial neural network, logic satisfiability in DHNN and activation function. [ABSTRACT FROM AUTHOR]

We study unification and admissibility for an infinite class of modal logics. Conditions superimposed to these logics are to be decidable, Kripke complete, and generated by the classes of rooted frames possessing the greatest clusters of states (in particular, these logics extend modal logic S4.2). Given such logic and each formula unifiable in , we construct a unifier for in , where verifies admissibility in of arbitrary inference rules with a switched-modality conclusions (i.e., solves the admissibility problem for such rules). [ABSTRACT FROM AUTHOR]

Kevin Dorst (2019) uses the 'manifest unassertability' of conditionals of the form 'If I don't know p ⁠ , then p ' as a new motivation for the KK thesis. In this paper we show that his argumentation is misguided. Plausible heuristics offer a compelling and nuanced explanation of the relevant infelicity data. Meanwhile, Dorst relies on tools that, quite independently of KK, turn out to be rather poor predictors of the infelicity of indicative conditionals. [ABSTRACT FROM AUTHOR]

Deep Neural Networks (DNNs) have achieved tremendous success in many applications, while it has been demonstrated that DNNs can exhibit some undesirable behaviors on concerns such as robustness, privacy, and other trustworthiness issues. Among them, fairness (i.e., non-discrimination) is one important property, especially when they are applied to some sensitive applications (e.g., finance and employment). However, DNNs easily learn spurious correlations between protected attributes (e.g., age, gender, race) and the classification task and develop discriminatory behaviors if the training data is imbalanced. Such discriminatory decisions in sensitive applications would introduce severe social impacts. To expose potential discrimination problems in DNNs before putting them in use, some testing techniques have been proposed to identify the discriminatory instances (i.e., instances that show defined discrimination1). However, how to repair DNNs after detecting such discrimination is still challenging. Existing techniques mainly rely on retraining on a large number of discriminatory instances generated by testing methods, which requires huge time overhead and makes the repairing inefficient. In this work, we propose the method Faire to effectively and efficiently repair the fairness issues of DNNs, without using additional data (e.g., discriminatory instances). Our basic idea is inspired by the traditional program repair method that synthesizes proper condition checking. To repair traditional programs, a typical method is to localize the program defects and repair the program logic by adding condition checking. Similarly, for DNNs, we try to understand the unfair logic and reformulate it with well-designed condition checking. In this article, we synthesize the condition that can reduce the effect of features relevant to the protected attributes in the DNN. Specifically, we first perform the neuron-based analysis and check the functionalities of neurons to identify neurons whose outputs could be regarded as features relevant to protected attributes and original tasks. Then a new condition layer is added after each hidden layer to penalize neurons that are accountable for the protected features (i.e., intermediate features relevant to protected attributes) and promote neurons that are accountable for the non-protected features (i.e., intermediate features relevant to original tasks). In sum, the repair rate2 of Faire reaches up to more than 99%, which outperforms other methods, and the whole repairing process only takes no more than 340 s. The evaluation results demonstrate that our approach can effectively and efficiently repair the individual discriminatory instances of the target model. [ABSTRACT FROM AUTHOR]

The purpose of this study is to assess from a corpus-based discourse-pragmatic perspective certain claims made in the literature concerning English wh - concessive conditional constructions (e.g. Whoever / No matter who comes to the party, it will be fun), namely that these utterance-types correlate with interrogative semantics, scalarity and potential modality. By means of an extensive investigation of corpus data these claims are shown to be largely unsupported by attested usage. Based on Dancygier and Sweetser's classification of conditional constructions, it is found that potential modality is paradigmatic only of content-level concessive conditionals, and not of the epistemic, speech-act or metalinguistic varieties. Contrary to claims in the literature, scalarity is demonstrated to not be typical of wh - concessive conditionals. The lack of scalarity in most wh - concessive conditionals is argued to cast into doubt the category label "concessive conditional" applied to these constructions in a substantial part of the literature and to favour an alternative designation such as "irrelevance conditional." The empirical data further reveals that wh - concessive conditionals practically never involve pure ignorance, and this is argued to be problematic on the discourse-pragmatic level for the claim that they have interrogative semantics. [ABSTRACT FROM AUTHOR]

Chemical mechanical planarization (CMP) is a complex and high-accuracy polishing process that creates a smooth and planar material surface. One of the key challenges of CMP is to predict the material removal rate (MRR) accurately. With the development of artificial intelligence techniques, numerous data-driven models have been developed to predict the MRR in the CMP process. However, these methods are not capable of considering surface topography in MRR predictions because it is difficult to observe and measure the surface topography. To address this issue, we propose a graphical model and a conditional variational autoencoder to extract the features of surface topography in the CMP process. Moreover, process variables and the extracted features of surface topography are fed into an ensemble learning-based predictive model to predict the MRR. Experimental results have shown that the proposed method can predict the MRR accurately with a root mean squared error of 6.12 nm/min, and it outperforms physics-based machine learning and data-driven methods. [ABSTRACT FROM AUTHOR]

This paper presents a broad view on inductive reasoning by embedding it in theories of epistemic states, conditionals, and belief revision. More precisely, we consider inductive reasoning as a specific case of belief revision on epistemic states which include conditionals as a basic means for representing beliefs. We present a general framework for inductive reasoning from conditional belief bases that also allows for taking background beliefs into account, and illustrate this by probabilistic reasoning based on optimum entropy as well as by rankingtheoretic reasoning based on so-called c-revision. We explain the philosophical perspective behind our approach, and we illustrate its constructive usefulness as well as its integrating power [ABSTRACT FROM AUTHOR]

The first aim of this article is to position analogical inference (or at least a particular form of it) in relation to induction. After a brief reminder on the induction of plausible conclusions in a probabilistic, logical, possibilistic settings, and with J. S. Mill’s methods of induction, we turn our attention to analogical inference, based on analogical proportions. Analogical proportions that hold between Boolean vectors are emphasized as a matter of pairs belonging to the same equivalence class. Then the mechanism of analogical proportions-based classification is explained and the main algorithms and results obtained so far are surveyed. After which, steps towards a logic of creativity are presented. The approach starts from the observation that analogical proportions belong to a larger set of quaternary relations called logical proportions. The six logical proportions giving birth to an equivalence relation between pairs are identified. This includes two important cases: i) a logic of conditional events known as being a basis for non monotonic reasoning (which is a form of plausible deduction) ; ii) a logic of ordered pairs preserving positive changes, closely related to analogical proportions. Within this framework, we revisit the creative nature of analogical proportions and introduce a creative inference mechanism that works on the basis of a specific situation and a collection of ordered pairs representing possible changes. [ABSTRACT FROM AUTHOR]

Copyright of Religación: Revista de Ciencias Sociales y Humanidades is the property of Religacion: Revista de Ciencias Sociales y Humanidades and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For suspension systems with asymmetric damping during the extension and compression strokes, the equilibrium position of the vehicle body will lift or drop. Inspired by this phenomenon, a novel idea of control the vehicle height by adjusting asymmetric damping via adjustable-damping semi-active suspensions is proposed. Meanwhile, a methodology to implement this idea is also presented. By accounting for nonlinear factors, such as the nonlinear constraints of the output damping force of an adjustable-damper and the logic control conditions of the asymmetric damping adjustment, this control system was designed as a hybrid system. Hybrid model predictive control theory was used to design this controller, and the switching control problem was transformed into a continuous-rolling finite-time-domain optimisation control problem. The feasibility of this idea was proven by simulations for single-wheel vehicle height control. The proposed idea makes it possible to use semi-active actuators for vehicle height adjustment to realise the control effect achieved by active actuators. Moreover, it has lower energy consumption, lower cost and faster response than active suspension, and provides a new method for short-term vehicle height and attitude control under some specific vehicle conditions, such as high-speed steering, and emergency obstacle avoidance, etc. [ABSTRACT FROM AUTHOR]

Some conditional involving factive emotives present a prima facie challenge to the thesis that conditionals obey modus ponens. Drawing on recent work by Timothy Williamson, I offer an error‐theoretic diagnosis of the phenomenon, one that appeals to a heuristic that we use in suppositional reasoning. [ABSTRACT FROM AUTHOR]

Dieser Beitrag verdeutlicht, dass eine umfassende Analyse des Phänomens der Reparatur sowohl „bottom-up"- als auch „top-down"-Initiativen berücksichtigen muss. Er zeigt, dass Reparaturpraktiken von Graswurzelinitiativen, Einzelpersonen und in hybriden Geschäftsmodellen organisiert werden, die RepairCafés, Plattformen im Internet oder Werkzeuge anbieten, um so vor allem Endnutzende zu erreichen. Daran anschließend werden top-down Ansätze auf europäischer und nationaler Ebene besprochen, die wichtige Reparaturinfrastrukturen durch politisch-rechtliche oder steuerliche Maßnahmen schaffen und auch auf Firmen abzielen. Argumentiert wird vor diesem Hintergrund, dass sich beide Ansätze in wichtigen Aspekten ergänzen, um Reparaturpraktiken und -infrastrukturen zu etablieren. Allerdings scheinen einige der mit Reparaturen als einer Praktik der Kreislaufwirtschaft verbundenen Hoffnungen unter Bedingungen kapitalistischer Verwertungslogik dennoch fraglich. This article emphasizes that a comprehensive analysis of repair must consider both "bottom-up" and "top-down" initiatives. It illustrates how repair practices are organised by grassroots initiatives, individuals, and hybrid business models that offer RepairCafés, online platforms, or tools to primarily reach end-users. Following this, top-down approaches at the European and national levels are discussed, which create essential repair infrastructures through political, legal, or fiscal measures, and also target businesses. Against this backdrop, I argue that both approaches complement each other in significant aspects to establish repair practices and infrastructures. However, some of the hopes associated with repair as a practice of the circular economy are questionable under conditions of capitalist logic. [ABSTRACT FROM AUTHOR]

Weak ontic necessity is the ontic necessity expressed by "should/ought to" in English. An example of it is "I should be dead by now". A feature of this necessity is that whether it holds at the present world is irrelevant to whether its prejacent holds at the present world. In this paper, by combining premise semantics and update semantics for conditionals, we present a logical theory for conditional weak ontic necessity based on context update. A context is a set of ordered defaults, determining expected possible states of the present world. Sentences are evaluated with respect to contexts. When evaluating the conditional weak ontic necessity with respect to a context, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We compare this theory to some related works. The logic's expressivity is studied. [ABSTRACT FROM AUTHOR]

Conditional statements are ubiquitous, from promises and threats to reasoning and decision making. By now, logicians have studied them from many different angles, both semantic and proof-theoretic. This paper suggests two more perspectives on the meaning of conditionals, one dynamic and one geometric, that may throw yet more light on a familiar and yet in some ways surprisingly elusive and many-faceted notion. 1 [ABSTRACT FROM AUTHOR]

Copyright of Management & Organization Review is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This article is a summary of a book titled "An Introduction to R and Python for Data Analysis: A Side-by-Side Approach." The book is designed to be accessible to a wide range of readers, including those without prior knowledge of R or Python. It primarily caters to data analysts and statisticians, but other professionals may also find value in it. The book is structured into three sections, covering the basics, common tasks and patterns, and programming styles. It includes practical exercises and covers a comprehensive range of topics in both languages. However, some readers may find the screenshots of various editors difficult to read due to the dark theme used. Overall, the book is a valuable resource for individuals looking to learn or refresh their knowledge of both R and Python. [Extracted from the article]

Mere capacity views hold that agents who can intervene in an unfolding movement are performing an agentially controlled action, regardless of whether they do intervene. I introduce a simple argument to show that the noncausal explanation offered by mere capacity views fails to explain both control and action. In cases where bodily subsystems, rather than the agent, generate control over a movement, agents can often intervene to override non-agential control. Yet, contrary to what capacity views suggest, in these cases, this capacity to intervene does not amount to agential control or action. I illustrate this with a case study of how passive breathing, a mere behavior, is misclassified by mere capacity views. I end by revisiting the central alternative to mere capacity views: causal control views. Advances in our understanding of how agents exert control over unfolding movements indicate that the nature of control is characterized by ubiquitous, small-scale causal interventions. [ABSTRACT FROM AUTHOR]

Indicative and subjunctive conditionals are in non-complimentary distribution: there are conversational contexts at which both are licensed (Stalnaker 1975 ; Karttunen and Peters 1979 ; von Fintel 1998). This means we can ask an important, but under-explored, question: in contexts which license both, what relations hold between the two? In this paper, I'll argue for an initially surprising conclusion: when attention is restricted to the relevant contexts, indicatives and subjunctives are co-entailing. §1 introduces the indicative/subjunctive distinction, along with a discussion of the relevant notion of entailment; §2 presents the main argument of the paper, and §3 considers some of the philosophical implications of the argument in §2. Finally, §4 argues that we can reconcile the equivalence of indicatives and subjunctives with apparently conflicting judgements. [ABSTRACT FROM AUTHOR]

One of central problems in the theory of conditionals is the construction of a probability space, where conditionals can be interpreted as events and assigned probabilities. The problem has been given a technical formulation by van Fraassen (23), who also discussed in great detail the solution in the form of Stalnaker Bernoulli spaces. These spaces are very complex – they have the cardinality of the continuum, even if the language is finite. A natural question is, therefore, whether a technically simpler (in particular finite) partial construction can be given. In the paper we provide a new solution to the problem. We show how to construct a finite probability space S # = Ω # , Σ # , P # in which simple conditionals and their Boolean combinations can be interpreted. The structure is minimal in terms of cardinality within a certain, naturally defined class of models – an interesting side-effect is an estimate of the number of non-equivalent propositions in the conditional language. We demand that the structure satisfy certain natural assumptions concerning the logic and semantics of conditionals and also that it satisfy PCCP. The construction can be easily iterated, producing interpretations for conditionals of arbitrary complexity. [ABSTRACT FROM AUTHOR]

Although it receives less attention, (Lewis in Noûs 13:455–476, 1979. https://doi.org/10.2307/2215339) admitted that the branching-time(-like) model fits a wide range of counterfactuals, including (Nix) 'If Nixon had pressed the button, there would have been a nuclear war', which was raised by (Fine in Mind 84:451–458, 1975). However, Lewis then claimed that similarity analysis is more general than temporality analysis. In this paper, we do not scrutinise his claim. Instead, we re-analyse (Nix) not only model-theoretically but also proof-theoretically from the 'meaning-as-use' and 'inferentialist' points of view. Then, we re-formalise (Nix) in a natural extension of hybrid tense logic, which we refer to as hybrid tense logic for temporal conditionals (HTL TC ). Consequently, we find that not only among counterfactuals, but also among indicatives, there is a wide range of conditionals whose formalisation in HTL TC is appropriate. We refer to these conditionals as temporal conditionals. This suggests a new logical generality that temporality analysis has but similarity analysis does not, from which emerges a new logical perspective on conditionals in general: temporal ones and others. [ABSTRACT FROM AUTHOR]

The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one obtains a system CI.0*Eq in whose language one can define an operator ↠ suitable to formalize context-dependent conditionals (so to counterfactual conditionals) via the definition (Def ↠) A ↠ B = df *A ⥽ B ∧ Ξ (Α, Β).. The central problem of the paper is to identify inside CI.0*Eq + Def ↠ a set of axioms yielding the fragment consisting of all and only theorems in which only truth-functional operators and the two operators → and ↠ occur. This system, here called CI.0 , is introduced in §3. In view of the intended purpose, it is introduced a complete and tableau-decidable system KT w , which is an extension of KT with axioms for the so-called quasi-variables w (A), w (B)... Three translation functions among the three languages used in the paper are then introduced. The first, Tr, maps every wff of form *A into wffs of form w (A) ∧ A and translates theorems of CI.0*Eq into theorems of KT w. The second, t°, translates theorems of CI.0 into theorems of CI.0*Eq by applying Def↠. A third one, t , translates theorems of CI.0 into theorems of KT w. As a consequence, it follows that t°A = Tr t A. In §4 it is proved that CI.0 is complete w.r.t. the class of CI.0 -models of form  where f is a selection function and R an access relation. It is then proved (i) that CI.0 models may be converted into KT w -models; (ii) that the truth-value of a proposition in a world of a CI.0 -model is preserved in the same world of the derived KT w -model; (iii) that A is a CI.0 -thesis iff its translation t A is KT w -thesis. It follows that, if A is not a CI.0 -thesis, t A is not a KT w -thesis, so also that Tr t A is not a CI.0*Eq-thesis. Since t°A = Tr t A and t°A is a function built on Def↠, this proves that every t°-translation of a CI.0 -wff that is a CI.0*Eq-theorem is a CI.0 -theorem. Since the converse proposition is proved in §2, their conjunction establishes the desired result. In the final section, it is proved that CI.0 is tableau-decidable, that ↠ is not a trivial operator and that ↠ enjoys the positive and negative properties required in §1 for context-dependent conditionals. Some final remarks suggest that studying the relations between CI.0 and systems of classical conditional logic may be a promising line of investigation. [ABSTRACT FROM AUTHOR]

Copyright of Arts Magazine is the property of Thamar University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The notion of rational expectations (RE) as usually understood seeks to encompass two different propositions: (i) perceived law of motion equals actual law of motion: an equivalence between the probability distributions of future outcomes which inform the decisions of agents and the objective distributions which generate those outcomes; (ii) perceived law of motion equals model law of motion: a correspondence of the subjective distributions underlying the choices of agents and the distributions generated by professionally validated models (particularly that which the analyst proposes contemporaneously). Both definitions are quite different unless absolute validity is counterfactually attributed to the provisional and fallible models constructed by economists. A further ambiguity arises with the model-consistent notion since the constructs built by economists have certainly evolved and will continue to change. If an economist imputes current-model-consistent expectations to agents in the past when trying to validate that model, she attributes to those individuals different beliefs from those that the analyst held at the time. These issues condition the logic and significance of large segments of macroeconomic theory. They seem particularly relevant for the study of phenomena like the processes leading to financial crises, where unsustainable patterns of behavior may have once found support in influential bodies of macroanalysis. [ABSTRACT FROM AUTHOR]

This article investigates how working conditions in East Germany differ from those in West Germany as well as from those among its Central and Eastern European (CEE) neighbors (Czech Republic, Hungary, and Poland). Building on repeated International Social Survey Programme (ISSP) survey data (1989, 1997, 2005, and 2015), the author compares key elements of East Germany's employment system with West Germany and its CEE neighbors over time. The results show that, initially, East Germany's conditions resembled a logic reflecting the need for economic survival that was distinct from West Germany and from the emerging general patterns of its CEE neighbors. By 2015, East and West German working conditions nearly converge. This article develops and extends the employment system approach to address situations of transformation and substantial institutional change, and contributes to the ongoing debate on regional diversity in Germany's economy. [ABSTRACT FROM AUTHOR]