Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Mani valued logics.
Articles de revues sur le sujet « Mani valued logics »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Mani valued logics ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.
1
Turunen, Esko. « Paraconsistent Many-Valued Logic in GUHA Framework ». Acta Informatica Pragensia 7, no 1 (30 juin 2018) : 104–11. http://dx.doi.org/10.18267/j.aip.116.
Texte intégral
2
Pawlowski, Pawel. « Tree-Like Proof Systems for Finitely-Many Valued Non-deterministic Consequence Relations ». Logica Universalis 14, no 4 (16 octobre 2020) : 407–20. http://dx.doi.org/10.1007/s11787-020-00263-0.
Texte intégralRésumé :
Abstract The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
3
Ciuni, Roberto, et Massimiliano Carrara. « Normality operators and classical recapture in many-valued logic ». Logic Journal of the IGPL 28, no 5 (29 novembre 2018) : 657–83. http://dx.doi.org/10.1093/jigpal/jzy055.
Texte intégralRésumé :
AbstractIn this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some (or all) of the three properties, namely subclassicality and two properties that we call fixed-point negation property and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively.
4
Непейвода, Н. Н. « Formalization as the Immanent Part of Logical Solving ». Logical Investigations 24, no 1 (30 mai 2018) : 129–45. http://dx.doi.org/10.21146/2074-1472-2018-24-1-129-145.
Texte intégralRésumé :
The work is devoted to the logical analysis of the problem solving by logical means. It starts from general characteristic of the applied logic as a tool: 1. to bound logic with its applications in theory and practice; 2. to import methods and methodologies from other domains into logic; 3. to export methods and methodologies from logic into other domains. The precise solving of a precisely stated logical problem occupies only one third of the whole process of solving real problems by logical means. The formalizing precedes it and the deformalizing follows it. The main topic when considering formalization is a choice of a logic. The classical logic is usually the best one for a draft formalization. The given problem and peculiarities of the draft formalization could sometimes advise us to use some other logic. If axioms of the classical formalization have some restricted form this is often the advice to use temporal, modal or multi-valued logic. More precisely, if all binary predicates occur only in premises of implications then it is possible sometimes to replace a predicate classical formalization by a propositional modal or temporal in the appropriate logic. If all predicates are unary and some of them occur only in premises then the classical logic maybe can replaced by a more adequate multi-valued. This idea is inspired by using Rosser–Turkette operator $J_i$in the book [22]. If we are interested not in a bare proof but in construction it gives us it is often to transfer to an appropriate constructive logic. Its choice is directed by our main resource (time, real values, money or any other imaginable resource) and by other restrictions.Logics of different by their nature resources are mutually inconsistent (e.g. nilpotent logics of time and linear logics of money). Also it is shown by example how Arnold’s principle works in logic: too “precise” formalization often becomes less adequate than more “rough”. DOI: 10.21146/2074-1472-2018-24-1-129-145
5
Iashin, Boris Leonidovich. « Non-Classical Logics in Modern Science ». Философская мысль, no 1 (janvier 2023) : 15–25. http://dx.doi.org/10.25136/2409-8728.2023.1.39350.
Texte intégralRésumé :
Non-classical logicians have significantly expanded the traditional field of using logical methods. The first of them was the three-digit logic of Y. Lukasevich. Next came the three-digit logic of A. Bochvar, the "quantum logics" of G. Reichenbach and P. Detush-Fevrier, infinite-valued, probabilistic and other logics. The possibilities of non-classical logics have become widely used in various branches of scientific knowledge. Polysemantic, fuzzy, intuitionistic, modal, relevant and paranoherent, temporal and other non-classical logics are widely used today in physics, computational mathematics, computer science, linguistics, jurisprudence, ethics and other fields of natural science and socio-humanitarian knowledge. The recently increased interest in non-classical logics is explained, first of all, by the fact that various philosophical, syntactic, semantic and metalogical problems that were previously discussed in the scientific community are being replaced by practical interests. The main source of such interest is their wide application in computer science, artificial intelligence and programming. The logic of causality is used in the interpretation of the concepts of "law of nature", "ontological necessity" and "determinism"; temporal modal logics - for modeling, specification and verification of software systems of logical control; logics with vector semantics, combining the features of fuzzy and para-contradictory logics - in solving problems of dynamic verification of production knowledge bases and expert systems.
6
Trzęsicki, Kazimierz. « Indeterministic Temporal Logic ». Studies in Logic, Grammar and Rhetoric 42, no 1 (1 septembre 2015) : 139–62. http://dx.doi.org/10.1515/slgr-2015-0034.
Texte intégralRésumé :
Abstract The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.
7
AVRON, ARNON, et YONI ZOHAR. « REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS ». Review of Symbolic Logic 12, no 1 (26 octobre 2018) : 173–200. http://dx.doi.org/10.1017/s1755020318000321.
Texte intégralRésumé :
AbstractThe operations of expansion and refinement on nondeterministic matrices (Nmatrices) are composed to form a new operation called rexpansion. Properties of this operation are investigated, together with their effects on the induced consequence relations. Using rexpansions, a semantic method for obtaining conservative extensions of (N)matrix-defined logics is introduced and applied to fragments of the classical two-valued matrix, as well as to other many-valued matrices and Nmatrices. The main application of this method is the construction and investigation of truth-preserving ¬-paraconsistent conservative extensions of Gödel fuzzy logic, in which ¬ has several desired properties. This is followed by some results regarding the relations between the constructed logics.
8
Kamide, Norihiro. « Inconsistency-Tolerant Multi-Agent Calculus ». International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 22, no 06 (décembre 2014) : 815–29. http://dx.doi.org/10.1142/s0218488514500433.
Texte intégralRésumé :
Verifying and specifying multi-agent systems in an appropriate inconsistency-tolerant logic are of growing importance in Computer Science since computer systems are generally used by or composed of inconsistency-tolerant multi-agents. In this paper, an inconsistency-tolerant logic for representing multi-agents is introduced as a Gentzen-type sequent calculus. This logic (or calculus) has multiple negation connectives that correspond to each agent, and these negation connectives have the property of paraconsistency that guarantees inconsistency-tolerance. The logic proposed is regarded as a modified generalization of trilattice logics, which are known to be useful for expressing fine-grained truth-values in computer networks. The completeness, cut-elimination and decidability theorems for the proposed logic (or sequent calculus) are proved as the main results of this paper.
9
Ono, Hiroakira, et Yuichi Komori. « Logics without the contraction rule ». Journal of Symbolic Logic 50, no 1 (mars 1985) : 169–201. http://dx.doi.org/10.2307/2273798.
Texte intégralRésumé :
We will study syntactical and semantical properties of propositional logics weaker than the intuitionistic, in which the contraction rule (or, the exchange rule or the weakening rule, in some cases) does not hold. Here, the contraction rule means the rule of inference of the formif we formulate our logics in a Gentzen-type formal system. Some syntactical properties of these logics have been studied firstly by the second author in [11], in connection with the study of BCK-algebras (for information on BCK-algebras, see [9]). There, it turned out that such a syntactical method is a powerful and promising tool in studying BCK-algebras. Using this method, considerable progress has been made since then (see, e.g., [8], [18], [27]).In this paper, we will study these logics more comprehensively. We notice here that the distributive lawdoes not hold necessarily in these logics. By adding some axioms (or initial sequents) and rules of inference to these basic logics, we can obtain a lot of interesting nonclassical logics such as Łukasiewicz's many-valued logics, relevant logics, the intuitionistic logic and logics related to BCK-algebras, which have been studied separately until now. Thus, our approach will give a uniform way of dealing with these logics. One of our two main tools in doing so is Gentzen-type formulation of logics in syntax, and the other is semantics defined by using partially ordered monoids.
10
De Martino, Mario. « Promotion of Political Values through International Programs of Academic Mobility ». RUDN Journal of Political Science 22, no 2 (15 décembre 2020) : 312–19. http://dx.doi.org/10.22363/2313-1438-2020-22-2-312-319.
Texte intégralRésumé :
Nation-states and international organizations widely use educational programs to foster students’ mobility abroad. The majority of scientific literature agrees in considering exchange programs as soft power instruments used by countries to promote their values in geopolitically and economically crucial regions. However, a more in-depth analysis of the reasons motivating nation-states to adopt such initiatives is needed to understand their political goals better. The current study consists of analysing the main formulations proposed by scholars, who delved into the topic of international academic mobility as a tool to promote values. The rationales of nation-states and international organizations to develop such programs of academic mobility can be very diverse (geopolitical, economic, and civic). The author described the main principles of each rationale (or logic), providing examples of existing educational programs adopted by countries or international organizations and how political values are promoted according to each logic. The boundaries between the four rationales described in the paper are not distinct and rigid. An educational program can respond at the same time to different logics, and the nation-states decide how to allocate resources to achieve specific results ascribable to a particular rationale. Although different rationales push nation-states and international organizations in promoting international programs of academic mobility, in all cases, such programs are instruments to promote political values.
11
DROSTE, MANFRED, et BUNDIT PIBALJOMMEE. « WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ». International Journal of Foundations of Computer Science 25, no 05 (août 2014) : 641–66. http://dx.doi.org/10.1142/s0129054114500269.
Texte intégralRésumé :
Nested words have been introduced by Alur and Madhusudan as a model for e.g. recursive programs or XML documents and have received much recent interest. In this paper, we investigate a quantitative automaton model and a quantitative logic for nested words. The behavior resp. the semantics map nested words to weights which are taken from a strong bimonoid. Strong bimonoids can be viewed as semirings without requiring the distributivity assumption which was essential in the classical theory of formal power series; strong bimonoids include e.g. all bounded lattices and many other structures from multi-valued logics. Our main results show that weighted nested word automata and suitable weighted MSO logics are expressively equivalent. This extends the classical Büchi-Elgot result from words to a weighted setting for nested words.
12
Chiriţă, Carmen. « Tense θ-valued Moisil propositional logic ». International Journal of Computers Communications & ; Control 5, no 5 (1 décembre 2010) : 642. http://dx.doi.org/10.15837/ijccc.2010.5.2220.
Texte intégralRésumé :
In this paper we study the tense θ-valued Moisil propositional calculus, a logical system obtained from the θ-valued Moisil propositional logic by adding two tense operators. The main result is a completeness theorem for tense θ-valued Moisil propositional logic. The proof of this theorem is based on the representation theorem of tense θ-valued Łukasiewicz-Moisil algebras, developed in a previous paper.
13
Koilo, Viktoriia. « Developing new business models : Logic of network value or cross-industry approach ». Problems and Perspectives in Management 19, no 2 (17 juin 2021) : 291–307. http://dx.doi.org/10.21511/ppm.19(2).2021.24.
Texte intégralRésumé :
Digital transition in the maritime industry creates new organizational models and affects the relationship between actors. New relationships require new business models (BMs). In addition, due to the paradigm of green shifts towards a zero-emission future of maritime shipping in 2050, stricter regulations require new solutions, and “business as usual” is not actual anymore. Thus, the study aims to investigate key drivers for creating new BMs and factors for their effective implementation by companies. The results of the study point to the main reasons for creating BMs. It was revealed that there are several external and internal prerequisites. Moreover, it was proved that considering the current tendency of the interfaces in relationships with different industries, it is important to talk about the development of BMs not only from a supply chain perspective. Moreover, it should be considered from the point of view of network value. Hence, the study highlights the need for a further investigation that aims to design new solutions, implement, test, and observe the effect of new BMs, considering collaborative ties between interested parties. AcknowledgmentThe study is supported by the grant from the Research Based Innovation “SFI Marine Operation in Virtual Environment (SFI-MOVE)” (Project no: 237929) in Norway.
14
Gottwald, Siegfried. « Mathematical Fuzzy Logics ». Bulletin of Symbolic Logic 14, no 2 (juin 2008) : 210–39. http://dx.doi.org/10.2178/bsl/1208442828.
Texte intégralRésumé :
AbstractThe last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics.The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.
15
Stampacchia, Paolo, Marco Tregua et Mariarosaria Coppola. « Zooming-in value-in-use through basic individual values ». Journal of Customer Behaviour 19, no 2 (31 août 2020) : 97–125. http://dx.doi.org/10.1362/147539220x15929906305116.
Texte intégralRésumé :
To overcome the vagueness that Service-Dominant Logic (SDL) scholars have found in conceptualisations of value-in-use due to the existence of different denominations and perspectives, this conceptual paper analyses the SDL literature, finding both value-in-use proposed as a comprehensive denomination, and resources, institutions, and time proposed as its main elements.<br/> Focusing on individuals as beneficiaries of value-in-use, the paper infuses the theory of basic individual values from social psychology in SDL, leading to three propositions that stress the ways in which basic individual values affect individuals' perceptions of resources, institutions, and time. Therefore, basic individual values act as lenses through which beneficiaries perceive flows of resources, institutions, and the time during which use occurs, thereby clarifying why value-in-use is always uniquely and phenomenologically determined by the beneficiary.<br/> This conceptual paper proposes basic individual values as micro-foundations of value co-creation, reveals ways to define the perceived value of resources, and leads practitioners to set value propositions according to basic individual values.
16
Pavlova, Alexandra. « Game-theoretical interpretation of abelian logic A ». Logical Investigations 25, no 2 (23 décembre 2019) : 75–93. http://dx.doi.org/10.21146/2074-1472-2019-25-2-75-93.
Texte intégralRésumé :
In the present paper we introduce a variation of Giles's game that captures the semantics of Slaney and Meyer's Abelian logic. This is a variation of the game earlier proposed for the Łukasiewicz infinitely-valued logic. We discuss two possible interpretations of this game. One of the interpretations involves a reference to different types of agents. We also give a brief description of the Abelian logic which as well corresponds to one of the comparative logics proposed by Casari. By different types of agents, we understand agents with diverse cognitive presumptions and capabilities. This reflects the idea that different agents can be encoded by a game (dialogue) semantics and truth (and validity) can be seen as a product of different types of communications between agents, establishing the relation between various types of moves available to the players and the resulting type of rationality. However, the main focus of the paper is concentrated on the technical result concerning the game proposed in the paper. In a separate section, we prove that this game is adequate to the Abelian logic. The game can be extended to the one allowing for the disjunctive strategies. As immediate future research, we suggest proving that Proponent’s winning strategies for some formula $F$ in the game for Abelian logic $\textbf{A}$ with disjunctive strategies correspond to a derivation of the formula $F$ in the hypersequent calculus $\textbf{GA}$.
17
Malinin, Len. « Technology selection based on main parameters of value and fuzzy logic ». International Journal of Business Innovation and Research 11, no 3 (2016) : 431. http://dx.doi.org/10.1504/ijbir.2016.078876.
Texte intégral
18
Malinin, Len. « Technology selection based on main parameters of value and fuzzy logic ». International Journal of Business Innovation and Research 11, no 3 (2016) : 431. http://dx.doi.org/10.1504/ijbir.2016.10000079.
Texte intégral
19
FLAMINIO, TOMMASO, HYKEL HOSNI et FRANCO MONTAGNA. « STRICT COHERENCE ON MANY-VALUED EVENTS ». Journal of Symbolic Logic 83, no 1 (12 février 2018) : 55–69. http://dx.doi.org/10.1017/jsl.2017.34.
Texte intégralRésumé :
AbstractWe investigate the property of strict coherence in the setting of many-valued logics. Our main results read as follows: (i) a map from an MV-algebra to [0,1] is strictly coherent if and only if it satisfies Carnap’s regularity condition, and (ii) a [0,1]-valued book on a finite set of many-valued events is strictly coherent if and only if it extends to a faithful state of an MV-algebra that contains them. Remarkably this latter result allows us to relax the rather demanding conditions for the Shimony-Kemeny characterisation of strict coherence put forward in the mid 1950s in this Journal.
20
Liu, Hai Yan. « Coding and Decoding Device Design of Three-Value Quantum Computer ». Applied Mechanics and Materials 713-715 (janvier 2015) : 1015–18. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.1015.
Texte intégralRésumé :
A quantum computer is the computer technology and the micro physical scientists will combine the technology achievements. Quantum computer is the processing of information by using the quantum properties of particle, a new concept quantum laws to control information transmission and processing of computer. Light has the advantages in space time parallel and high-frequency radiation, which makes the optical become the main target of research model the future of computers. This did not prevent the three valued logic calculus is still an important part of the three values of optical computer. It is precisely because the three value of optical code decoder and the three value, importance, ALU logic optical so, in three valued optical computer all the key parts, we firstly research the value of three logic optical light coding, decoder and a value of three.
21
Wang, Haiyan, Qiuzhen Lin, Jianyong Chen, Jianqiang Li, Jianghua Zhong, Dongdai Lin, Jia Wang et Lijia Ma. « On Stability of Multi-Valued Nonlinear Feedback Shift Registers ». Complexity 2019 (21 février 2019) : 1–11. http://dx.doi.org/10.1155/2019/8765970.
Texte intégralRésumé :
Nonlinear feedback shift registers (NFSRs) are the main building blocks in many convolutional decoders, and a stable NFSR can limit decoding error propagation. Due to lack of efficient algebraic tools, the stability of multi-valued NFSRs has been much less studied. This paper studies the stability of multi-valued NFSRs using a logic network approach. A multi-valued NFSR can be viewed as a logic network. Based on its logic network representation, some sufficient and necessary conditions are provided for globally (locally) stable multi-valued NFSRs, explicit forms are given for the set of basins, and the algorithm for obtaining the set of basins is provided as well. Finally, a new method is presented for constructing stable n+1-stage NFSRs from stable n-stage NFSRs by the properties of D-morphism.
22
MALININ, Len. « On Application of Main Parameters of Value and Fuzzy Logic to Technology Selection ». Open Journal of Industrial and Business Management 2, no 2 (2014) : 23. http://dx.doi.org/10.12966/ojibm.05.02.2014.
Texte intégral
23
Jiang, Yaozhi. « Atomic Proposition and 1-Order Predicate Function for Dialectical Logic ». Journal of Mathematics Research 11, no 3 (13 mai 2019) : 50. http://dx.doi.org/10.5539/jmr.v11n3p50.
Texte intégralRésumé :
This paper has completed main fields of making dialectical logic pure mathematically, it is involved both atomic proposition and 1-order predicate function for dialectical logic, and by state-dual, true-valued function vector, state-contradiction law into basic logic law. In addition, also defines true-valued function for logic operators so that more easy to represent atomic proposition. Some examples are given and shown that Boolean algebra, as a special case of dialectical logic, is how to operate hybridize-able with dialectical logic.
24
Fatić, Aleksandar. « Personality as an ecology of values ». Socium i vlast 4 (2021) : 18–25. http://dx.doi.org/10.22394/1996-0522-2021-2-18-25.
Texte intégralRésumé :
The paper examines the concept of individual and collective value identities based an emotionalist understanding of values. The main perspective it discusses is one where emotions are the most important practical instruments for the clarification of individual and collective values. The argument implies that moral emotions are not irrational, but have a logic of their own which can reliably pinpoint the persons’ value system; emotions are thus crucial building blocks of an ethics which is able to enhance personal and moral identity. This particular ecology of moral emotions is pivotal in crisis periods, such as the global pandemics, wars or system crashes, either economic, or political, security, diplomatic or cultural. In the current circumstances, where the already shaken individual and collective values throughout the world have been shaken by the Covid 19 pandemic, understanding identities as fundamentally couched in moral emotions may be critical to saving our cultures and our legacies of social and moral capital.
25
Iashin, Boris Leonidovich. « Paradoxes in scientific cognition and nonclassical logics ». Философская мысль, no 2 (février 2020) : 53–64. http://dx.doi.org/10.25136/2409-8728.2020.2.32172.
Texte intégralRésumé :
The subject of this research is the scientific paradoxes and such means for its resolution as nonclassical logics. The author defends a thesis that paradoxes often stimulate the scientific development. It is demonstrated that most vividly the problem of paradoxes manifested in crises in the fundamentals of mathematics; the attempts for its resolution in many ways contributes to the emergence of nonclassical logics. It is substantiated that nonclassical logics helped to resolve and explain the paraded occurring in scientific cognition. Comparative analysis is conducted on the capabilities of three-valued “quantum logics” of Garrett Birkhoff and John von Neumann and “logics of complementarity” of Hans Reichenbach. Potential of the three-valued logics of D. Bochvar and nonclassical systems of A. Zinoviev in resolution and explanation of logical paradoxes, as well as importance of temporary logics of G. H. Wright for the philosophy of science is revealed. Special attention is paid to the paraconsistent logics. The author determines two points of view in understanding of their essence and value for science and philosophy, which juxtaposition shows that none of them fully complies with the actual state of affairs. The main conclusion consists in the statement that paradoxes of scientific cognition should not be assessed just negatively; they also carry a positive meaning: detection of paradoxes in the theory testifies to the need for their elimination, more detailed research and stricter approach towards development of the theory, which in solution of this task can be accomplished by nonclassical logics.
26
Otto, Martin. « The expressive power of fixed-point logic with counting ». Journal of Symbolic Logic 61, no 1 (mars 1996) : 147–76. http://dx.doi.org/10.2307/2275602.
Texte intégralRésumé :
AbstractWe study the expressive power in the finite of the logic Fixed-Point+Counting, the extension of first-order logic which is obtained through adding both the fixed-point constructor and the ability to count.To this end an isomorphism preserving (‘generic’) model of computation is introduced whose PTime restriction exactly corresponds to this level of expressive power, while its PSpace restriction corresponds to While+Counting. From this model we obtain a normal form which shows a rather clear separation of the relational vs. the arithmetical side of the algorithms involved.In parallel, we study the relations of Fixed-Point+Counting with the infinitary logics and the corresponding pebble games.The main result, however, involves the concept of an arithmetical invariant. By this we mean a functor taking every finite relational structure to an expansion of (an initial segment of) the standard arithmetical structure. In particular its values are linearly ordered structures. We establish the existence of a family of arithmetical invariants with the following properties:• The invariants themselves can be evaluated in polynomial time.• A class of finite relational structures is definable in Fixed-Point+Counting if and only if membership can be decided in polynomial time on the basis of the values of one of the invariants.• The invariant r classifies all finite relational structures exactly up to equivalence with respect to the logic We also give a characterization of Fixed-Point+Counting in terms of sequences of formulae in the : It corresponds exactly to the polynomial time computable families (φn)n ∈ ω in these logics.Towards a positive assessment of the expressive power of Fixed-Point+Counting, it is shown that the natural extension of fixed-point logic by Lindström quantifiers, which capture all the PTime computable properties of cardinalities of definable predicates, is strictly weaker than what we get here. This implies in particular that every extension of fixed-point logic by means of monadic Lindström quantifiers, which stays within PTime, must be strictly contained in Fixed-Point+Counting.
27
Ghorani, Maryam. « State hyperstructures of tree automata based on lattice-valued logic ». RAIRO - Theoretical Informatics and Applications 52, no 1 (janvier 2018) : 23–42. http://dx.doi.org/10.1051/ita/2018004.
Texte intégralRésumé :
In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for L-valued tree automata, and the other one leads to the creation of a minimal v-valued tree automaton that accepts the same language as the given one.
28
Reiser, Renata Hax Sander, et Benjamin Bedregal. « Correlation in Interval-Valued Atanassov’s Intuitionistic Fuzzy Sets — Conjugate and Negation Operators ». International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25, no 05 (4 septembre 2017) : 787–819. http://dx.doi.org/10.1142/s0218488517500349.
Texte intégralRésumé :
This paper studies the conjugate functions related to main connectives of the Intervalvalued Atanassov’s Intuitionistic Fuzzy Logic. The relationships among automorphism classes are formalized by the ϕ-representability theorem, passing from automorphisms to interval-valued intuitionistic automorphisms, also visiting other two ones, intuitionistic automorphisms and interval-valued automorphisms. Additionally, the ϕ-conjugate of an interval-valued Atanassov’s intuitionistic fuzzy negation can be obtained either from an interval-valued fuzzy negation or from an Atanassov’s intuitionistic fuzzy negation, including a discussion presenting such reverse constructions. The ϕ-conjugate of an interval-valued Atanassov’s intuitionistic fuzzy negation not only preserves the main properties of its corresponding fuzzy negation but also of two other ones, the intuitionistic fuzzy negation and interval-valued fuzzy negation. Moreover, an extension of the intuitionistic fuzzy index as well as the correlation coefficient is discussed in terms of fuzzy negations, by considering the Atanassov’s Intuitionistic Fuzzy Logic.
29
Hamdi, Thouraya, Adel Ghith et Faten Fayala. « Fuzzy Logic Method for Predicting the Effect of Main Fabric Parameters Influencing Drape Phenomenon ». Autex Research Journal 20, no 3 (18 septembre 2020) : 220–27. http://dx.doi.org/10.2478/aut-2019-0034.
Texte intégralRésumé :
AbstractThe main aspect of this research was to predict the drape parameters and describe clearly the drape phenomenon using fuzzy logic method. Forecasting features allow manufacturers to save time and improve their productivity. The bending rigidity, (in warp, weft, and skew direction), shear rigidity, and weight of fabric samples were used as the key input variables for the model, whereas drape coefficient, drape distance ratio, folds depth index, and node number were used as output/response variables. The results show that changing the values of fabric parameters significantly affected the fabric drape and a representative correlation values were found between the experimental values and those calculated by the fuzzy system.
30
PAWLOWSKI, PAWEL, et RAFAL URBANIAK. « MANY-VALUED LOGIC OF INFORMAL PROVABILITY : A NON-DETERMINISTIC STRATEGY ». Review of Symbolic Logic 11, no 2 (juin 2018) : 207–23. http://dx.doi.org/10.1017/s1755020317000363.
Texte intégralRésumé :
AbstractMathematicians prove theorems in a semi-formal setting, providing what we’ll call informal proofs. There are various philosophical reasons not to reduce informal provability to formal provability within some appropriate axiomatic theory (Leitgeb, 2009; Marfori, 2010; Tanswell, 2015), but the main worry is that we seem committed to all instances of the so-called reflection schema: B(φ) → φ (where B stands for the informal provability predicate). Yet, adding all its instances to any theory for which Löb’s theorem for B holds leads to inconsistency.Currently existing approaches (Shapiro, 1985; Horsten, 1996, 1998) to formalizing the properties of informal provability avoid contradiction at a rather high price. They either drop one of the Hilbert-Bernays conditions for the provability predicate, or use a provability operator that cannot consistently be treated as a predicate.Inspired by (Kripke, 1975), we investigate the strategy which changes the underlying logic and treats informal provability as a partial notion. We use non-deterministic matrices to develop a three-valued logic of informal provability, which avoids some of the above mentioned problems.
31
Mintrop, Rick, Miguel Ordenes, Erin Coghlan, Laura Pryor et Cristobal Madero. « Teacher Evaluation, Pay for Performance, and Learning Around Instruction : Between Dissonant Incentives and Resonant Procedures ». Educational Administration Quarterly 54, no 1 (1 mars 2017) : 3–46. http://dx.doi.org/10.1177/0013161x17696558.
Texte intégralRésumé :
Purpose: The study examines why the logic of a performance management system, supported by the federal Teacher Incentive Fund, might be faulty. It does this by exploring the nuances of the interplay between teaching evaluations as formative and summative, the use of procedures, tools, and artifacts obligated by the local Teacher Incentive Fund system, and bonus payments as extrinsic motivators. Research Methods: The study is a qualitative longitudinal study in three public charter schools that were selected as a presumably conducive environment for incentive-driven performance management. Eight rounds of semistructured interviews, 130 interviews, and 65 hours of meeting observations are the data for this study. Findings: In the three charter schools, the adoption period was characterized by consonance, the belief that the performance management system served valued purposes. In midlife, dissonance set in. Performance contingencies attached to both bonus and external evaluations were perceived as disconfirming the values of the schools. Incentives and status competition were largely rebuffed and relegated to the periphery. Once the power of incentives became latent, a period of resonance set in. Administrators and teachers came to interact with the two main artifacts, videos of lessons and the Summative Evaluation of Teaching observation tool, in ways that afforded new learning. Implications for Research and Practice: The study suggests that research insights can be gained when logics of complex performance management systems are disentangled and competing dynamics deliberately studied. Practically speaking, when schools try to maintain a rich collegial culture, incentives may crowd out the use of teaching evaluations for formative learning.
32
Frické, Martin. « Boolean Logic ». KNOWLEDGE ORGANIZATION 48, no 2 (2021) : 177–91. http://dx.doi.org/10.5771/0943-7444-2021-2-177.
Texte intégralRésumé :
The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to knowledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in knowledge organization.
33
Шалак, В. И. « Some Remarks on A. Tamminga’s Paper “Correspondence Analysis for Strong Three-valued Logic” ». Logical Investigations 23, no 2 (5 octobre 2017) : 96–97. http://dx.doi.org/10.21146/2074-1472-2017-23-2-96-97.
Texte intégralRésumé :
In this note we present two remarks to the A. Tamminga’s paper. The first remark relates to incorrect Definition 1, and the second remark relates to the main theorem of the paper. We propose the necessary corrections. DOI: 10.21146/2074-1472-2017-23-2-96-97
34
GOODMAN, I. R., et H. T. NGUYEN. « MATHEMATICAL FOUNDATIONS OF CONDITIONALS AND THEIR PROBABILISTIC ASSIGNMENTS ». International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 03, no 03 (septembre 1995) : 247–339. http://dx.doi.org/10.1142/s0218488595000165.
Texte intégralRésumé :
This paper addresses the mathematical modeling of information as originally expressed in natural language in conditional form. A number of different conditional event algebras—all avoiding the Lewis triviality result—are briefly surveyed, including the main body of those proposed previously, classified as Type I, and the newly expanded Type II product space approach (PS) originally independently offered by Van Fraasen. The issue of higher order conditionals and triviality is also discussed. In addition, this work considers two basic results of McGee: Firstly, this paper provides a new general procedure (M) which specializes to that result of McGee, where in effect, the probability evaluations of logical compounds of conditionals in the PS approach are independently derived from a fair standard betting scheme, though McGee does not obtain any explicit conditional event algebra underpinning for these evaluations. The new procedure, which can act upon any Type I conditional event algebra, is based, in part, upon decision theory principles, and in part, upon a fine-tuned evaluation of the third or indeterminate values of the three-valued logic form of Type I conditionals. It is shown that McGee’s derivation is equivalent to M acting upon the Type I conditional event algebra called GNW in the literature—or equivalently the min, max, 1-() conjunctive, disjunctive, negation fragment of Lukasiewicz’ three-valued logic. On the other hand, it is shown that the action of M upon another Type I conditional event algebra called SAC in the literature—equivalent to a corresponding fragment of a three-valued logic originally proposed by Sobocinski—leads back to the same conditional event algebra. Secondly, this paper provides a new characterization of PS , corresponding to McGee’s second result, and which, unlike McGee, does not assume—nor is compatible, in general, with—the import-export rule. Among other topics discussed, are conditional random variables, deduction and non-monotonic logic applications.
35
Schang, Fabien. « The Football of Logic ». Studia Humana 6, no 1 (1 mars 2017) : 50–60. http://dx.doi.org/10.1515/sh-2017-0006.
Texte intégralRésumé :
Abstract An analogy is made between two rather different domains, namely: logic, and football (or soccer). Starting from a comparative table between the two activities, an alternative explanation of logic is given in terms of players, ball, goal, and the like. Our main thesis is that, just as the task of logic is preserving truth from premises to the conclusion, footballers strive to keep the ball as far as possible until the opposite goal. Assuming this analogy may help think about logic in the same way as in dialogical logic, but it should also present truth-values in an alternative sense of speech-acts occurring in a dialogue. The relativity of truth-values is focused by this way, thereby leading to an additional way of logical pluralism.
36
Moussa, Soumaya, Saoussen Bel Hadj Kacem et Moncef Tagina. « Unification of Imprecise Data ». International Journal of Fuzzy System Applications 11, no 1 (janvier 2022) : 1–27. http://dx.doi.org/10.4018/ijfsa.292459.
Texte intégralRésumé :
Inference systems are a well-defined technology derived from knowledge-based systems. Their main purpose is to model and manage knowledge as well as expert reasoning to insure a relevant decision making while getting close to human induction. Although handled knowledge are usually imperfect, they may be treated using a non classical logic as fuzzy logic or symbolic multi-valued logic. Nonetheless, it is required sometimes to consider both fuzzy and symbolic multi-valued knowledge within the same knowledge-based system. For that, we propose in this paper an approach that is able to standardize fuzzy and symbolic multi-valued knowledge. We intend to convert fuzzy knowledge into symbolic type by projecting them over the Y-axis of their membership functions. Consequently, it becomes feasible working under a symbolic multi-valued context. Our approach provides to the expert more flexibility in modeling their knowledge regardless of their type. A numerical study is provided to illustrate the potential application of the proposed methodology.
37
STÄRK, ROBERT F. « CUT-PROPERTY AND NEGATION AS FAILURE ». International Journal of Foundations of Computer Science 05, no 02 (juin 1994) : 129–64. http://dx.doi.org/10.1142/s0129054194000086.
Texte intégralRésumé :
What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A rule based sequent calculus is used in which a sequent is provable if, and only if, it is true in all three-valued models of the completion of a logic program. The main theorem is that proofs in the sequent calculus can be transformed into SLDNF-computations if, and only if, a program has the cut-property. A fragment of the sequent calculus leads to a sound and complete semantics for SLDNF-resolution with substitutions. It turns out that this version of SLDNF-resolution is sound and complete with respect to three-valued possible world models of the completion for arbitrary logic programs and arbitrary goals. Since we are dealing with possibly nonterminating computations and constructive proofs, three-valued possible world models seem to be an appropriate semantics.
38
Kutsak, Nina Yu, et Vladislav V. Podymov. « Formal Verification of Three-Valued Digital Waveforms ». Modeling and Analysis of Information Systems 26, no 3 (28 septembre 2019) : 332–50. http://dx.doi.org/10.18255/1818-1015-2019-3-332-350.
Texte intégralRésumé :
We investigate a formal verification problem (mathematically rigorous correctness checking) for digital waveforms used in practical development of digital microelectronic devices (digital circuits) at early design stages. According to modern methodologies, a digital circuit design starts at high abstraction levels provided by hardware description languages (HDLs). One of essential steps of an HDLbased circuit design is an HDL code debug, similar to the same step of program development in means and importance. A popular way of an HDL code debug is based on extraction and analysis of a waveform, which is a collection of plots for digital signals: functional descriptions of value changes related to selected circuit places in real time. We propose mathematical means for automation of correctness checking for such waveforms based on notions and methods of formal verification against temporal logic formulae, and focus on such typical featues of HDL-related digital signals and corresponding (informal) properties, such as real time, three-valuededness, and presence of signal edges. The three-valuededness means that at any given time, besides basic logical values 0 and 1, a signal may have a special undefined value: one of the values 0 and 1, but which one of them is either not known, or not important. An edge point of a signal is a time point at which the signal changes its value. The main results are mathematical notions, propositions, and algorithms which allow to formalize and solve a formal verification problem for considered waveforms, including: definitions for signals and waveforms which the mentioned typical digital signal features; a temporal logic suitable for formalization of waveform correctness properties, and a related verification problem statement; a solution technique for the verification problem, which is based on reduction to signal transfromation and analysis; a corresponding verification algorithm together with its correctness proof and “reasonable” complexity bounds.
39
Arena, Marika, Giovanni Azzone et Giulia Piantoni. « Uncovering value creation in innovation ecosystems : paths towards shared value ». European Journal of Innovation Management 25, no 6 (9 novembre 2021) : 432–51. http://dx.doi.org/10.1108/ejim-06-2021-0289.
Texte intégralRésumé :
PurposeAlthough innovation ecosystems (IEs) are generally considered capable of creating shared value (SV), this potentiality has often been taken for granted and not deeply analysed, yet. As a result, in the literature, there is not a framework that defines the process of SV creation in IEs or which aspects should be considered for understanding it. Moving from these considerations, this paper aims to propose a conceptual model of how IEs can create SV, identifying the main building blocks of the process and the aspects that characterize these building blocks.Design/methodology/approachThe authors reviewed the literature on IEs and value creation over the last 15 years, by structurally analysing 120 articles. On the basis of such review, the authors identified main dimensions of analysis focusing on the conceptualization of SV in IEs.FindingsFirst, the authors developed a conceptual model relying on a process-based logic and framing the SV creation in terms of inputs, here intended as four key characteristics (actors, structure, governance and relations), internal processes (strategies and internal mechanisms) and outputs (the value created). Second, each element of value creation is explored, highlighting the main evidence emerging from prior studies in connection to each block.Originality/valueThis paper drives the identification of some relevant relationships that connect the characteristics of the IEs, the strategies and the internal mechanisms to the output of the process, i.e. the SV created.
40
AL-RABADI, ANAS N. « QUANTUM LOGIC CIRCUIT DESIGN OF MANY-VALUED GALOIS REVERSIBLE EXPANSIONS AND FAST TRANSFORMS ». Journal of Circuits, Systems and Computers 16, no 05 (octobre 2007) : 641–71. http://dx.doi.org/10.1142/s0218126607003939.
Texte intégralRésumé :
Many-valued quantum circuit synthesis of many-valued reversible expansions and fast transforms is introduced in this paper. Since the reduction of power consumption is a major requirement for the circuit design in future technologies, such as in quantum computing, the main features of several future technologies will include reversibility. Consequently, the new quantum circuits can play an important task in the design of future circuits that consume minimal power. In addition, the new quantum circuit methodology is general and can be used to realize any multiple-valued function in the quantum space. It is also shown that the structural generality advantage that results from the new design methodology is opposed with the increased quantum structural complexity disadvantage which may be considered in any further cost-benefit design analysis.
41
BARBERO, FAUSTO. « ON EXISTENTIAL DECLARATIONS OF INDEPENDENCE IN IF LOGIC ». Review of Symbolic Logic 6, no 2 (26 mars 2013) : 254–80. http://dx.doi.org/10.1017/s175502031200038x.
Texte intégralRésumé :
AbstractWe analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of Independence-Friendly (IF) sentences; we give a syntactical criterion to decide whether a sentence beginning with such prefix exists, such that its truth values may be affected by removal of the declaration of independence. We extend the result also to equilibrium semantics values for undetermined IF sentences.The main theorem defines a schema of sound and recursive inference rules; we show more explicitly what happens for some simple special classes of sentences.In the last section, we extend the main result beyond the scope of prenex sentences, in order to give a proof of the fact that the fragment of IF sentences with knowledge memory has only first-order expressive power.
42
Morano, Pierluigi, Francesco Tajani et Marco Locurcio. « Land Use, Economic Welfare and Property Values ». International Journal of Agricultural and Environmental Information Systems 6, no 4 (octobre 2015) : 16–39. http://dx.doi.org/10.4018/ijaeis.2015100102.
Texte intégralRésumé :
In the paper an analysis of functional correlations of property prices with the main locational and socio-economic variables, which generally contribute to define the market value of properties, has been developed. Locational characteristics are represented by the surfaces of soil used for the main functions, borrowing the logic of the system of classification of CORINE Land Cover (European Commission). The analysis has been contextualized to the 258 municipalities of the Apulia region (Southern Italy), and has been referred to two different moments (years 2006 and 2011), and two different market segments (residential and retail). The functional relationships between property prices and explanatory variables considered, estimated through a software that implements a genetic algorithm, are particularly interesting. The methodology outlined constitutes a valuable reference for the definition of models aimed at supporting, in a more rational and convenient way, public planning decisions and private investment choices.
43
Yin, Yimu. « Henselianity and the Denef-Pas language ». Journal of Symbolic Logic 74, no 2 (juin 2009) : 655–64. http://dx.doi.org/10.2178/jsl/1243948332.
Texte intégralRésumé :
AbstractWe prove that if an equicharacteristic valued field has a ℤ-group as its value group and admits quantifier elimination in the main sort of the prototypical Denef-Pas style language then it is henselian. In fact the proof of this suggests that a reasonable class of Denef-Pas style languages is natural with respect to henselianity.
44
Simone, Cristina, Antonio La Sala et Marta Maria Montella. « The rise of P2P ecosystem : a service logics amplifier for value co-creation ». TQM Journal 29, no 6 (9 octobre 2017) : 863–80. http://dx.doi.org/10.1108/tqm-04-2017-0047.
Texte intégralRésumé :
Purpose The purpose of this paper is to examine peer production (P2P) conceived as an ecosystem for value co-creation. First, this paper provides information on the specific P2P method for value co-creation, which is based on distributed technologies, cognitive slack and search for quality, to provide outputs that are open to continuous improvement. Second, aiming to fill the extant literature gap, this paper discusses the efficient dimension of P2P, providing a framework for the net benefit analysis of the economies and diseconomies that affect the value co-creation processes. Design/methodology/approach The paper identifies three main literature clusters that are focused on P2P, namely, economical, sociological and organizational clusters, and integrates them with the economics of organizational perspective to elicit information on the efficient dimension of P2P. This efficient dimension is expressed by a net benefit analysis of the economies and diseconomies that affect the P2P value co-creation processes. Findings The P2P ecosystem is characterized by the intensive interaction among cognitive slack and distributed technologies. This complex interaction presents interesting implications in terms of efficiency that, until now, have not been analyzed in the literature. Aiming to fill the extant literature gap, this paper provides a consistent analytical framework that simultaneously takes into account the economies of knowledge integration and potential diseconomies, that is, the costs of coordination and loss of control that arise from the adoption and diffusion of distributed technologies. Originality/value This paper provides an original explanation of P2P as an emergent ecosystem that serves as a service logics amplifier of value co-creation. In this regard, analysis of the key features of P2P not only sheds new light on P2P, but also allows for the reflection on the ecosystem’s framework, which promotes a virtuous interaction between the conceptual speculation and understanding of reality. Moreover, the proposed framework for the net benefit analysis of the P2P value co-creation model draws the attention of managers and decision makers as they consider the following issue: value co-creation jointly considers not only its benefits, but also its associated costs.
45
Botti, Antonio, et Antonella Monda. « Sustainable Value Co-Creation and Digital Health : The Case of Trentino eHealth Ecosystem ». Sustainability 12, no 13 (29 juin 2020) : 5263. http://dx.doi.org/10.3390/su12135263.
Texte intégralRésumé :
This paper aims to develop a theoretical framework based on recent service theories, such as service-dominant logic and service science, and on the concept of service ecosystems. The identification of the main elements of service ecosystems allows for pinpointing the main drivers for sustainable value co-creation, which is intended as the creation in the long run of new service solutions set up with and for end-users to guarantee a better service for the whole society. Given the high interactivity required in the relationship between players involved in digital health services, we decided to apply the developed framework to eHealth, to re-read the eHealth sector as a service ecosystem. The model is tested through a case study represented by digital healthcare in the Autonomous Province of Trento, which represents a best practice in this sector. The results confirm the presence of the main elements of the service ecosystem (actors, resource integration, technology, institutions) in the eHealth sector and show how their integration favours the creation of new resources, new uses of technology and new institutions that produce innovation and sustainable value co-creation. The originality of the work lies in the reconceptualization of the digital health sector from a new perspective based on the assumptions of service-dominant logic, that allow us to analyze the eHealth ecosystem in a holistic and system view.
46
Selivanov, V. L. « Fine hierarchies and Boolean terms ». Journal of Symbolic Logic 60, no 1 (mars 1995) : 289–317. http://dx.doi.org/10.2307/2275522.
Texte intégralRésumé :
AbstractWe consider fine hierarchies in recursion theory, descriptive set theory, logic and complexity theory. The main results state that the sets of values of different Boolean terms coincide with the levels of suitable fine hierarchies. This gives new short descriptions of these hierarchies and shows that collections of sets of values of Boolean terms are almost well ordered by inclusion. For the sake of completeness we mention also some earlier results demonstrating the usefulness of fine hierarchies.
47
Zack, Yu A. « Hierarchical Fuzzy-Logic Expert Systems for Medical Diagnostics ». Informacionnye Tehnologii 28, no 4 (14 avril 2022) : 202–11. http://dx.doi.org/10.17587/it.28.202-211.
Texte intégralRésumé :
Unlike numerous publications on the application of fuzzy logic in medicine, where the main attention was paid to the medical features of the problem, this work for the first time formulates the most effective areas and general methodological aspects of constructing such systems. The structure, methods of creating knowledge bases and the sequence of decision-making based on them by a specialist doctor are presented. The types of membership functions that are advisable to use to represent the symptoms of diseases are proposed. In fuzzy-logical conclusions, not only the values of the characteristic functions of the logical terms of individual symptoms are used, but also complex arithmetic functions of their values.
48
Fatić, Aleksandar. « Personality as an ecology of values ». Socium i vlast 4 (2021) : 26–35. http://dx.doi.org/10.22394/1996-0522-2021-2-26-35.
Texte intégralRésumé :
The paper examines the concept of individual and collective value identities based an emotionalist understanding of values. The main perspective it discusses is one where emotions are the most important practical instruments for the clarification of individual and collective values. The argument implies that moral emotions are not irrational, but have a logic of their own which can reliably pinpoint the persons’ value system; emotions are thus crucial building blocks of an ethics which is able to enhance personal and moral identity. This particular ecology of moral emotions is pivotal in crisis periods, such as the global pandemics, wars or system crashes, either economic, or political, security, diplomatic or cultural. In the current circumstances, where the already shaken individual and collective values throughout the world have been shaken by the Covid-19 pandemic, understanding identities as fundamentally couched in moral emotions may be critical to saving our cultures and our legacies of social and moral capital.
49
Schang, Fabien. « A Judgmental Reconstruction of Some of Professor Woleński’s Logical and Philosophical Writings ». Studia Humana 9, no 3-4 (1 octobre 2020) : 72–103. http://dx.doi.org/10.2478/sh-2020-0029.
Texte intégralRésumé :
Abstract Roman Suszko said that “Obviously, any multiplication of logical values is a mad idea and, in fact, Łukasiewicz did not actualize it.” The aim of the present paper is to qualify this ‘obvious’ statement through a number of logical and philosophical writings by Professor Jan Woleński, all focusing on the nature of truth-values and their multiple uses in philosophy. It results in a reconstruction of such an abstract object, doing justice to what Suszko held a ‘mad’ project within a generalized logic of judgments. Four main issues raised by Woleński will be considered to test the insightfulness of such generalized truth-values, namely: the principle of bivalence, the logic of scepticism, the coherence theory of truth, and nothingness.
50
Nordberg, Tanja H. « Managers’ views on employees’ parental leave : Problems and solutions within different institutional logics ». Acta Sociologica 62, no 1 (2 avril 2018) : 81–95. http://dx.doi.org/10.1177/0001699318759781.
Texte intégralRésumé :
An examination of managers’ perspectives on employees’ parental leave rights is presented, drawing on qualitative interviews with 34 managers in the Norwegian police and in the legal profession. The aim of the article is to explore how managers approach employees’ parental leave within different institutional logics and how their approach relates to gendered norms of good parenthood. According to these norms, parental leave is used fully, but mothers take the main share of the leave. The findings show that the managers do not necessarily perceive parental leave as a problem. However, the practical solutions the managers propose to possible challenges give important clues about what parental leave entails within the frame of different institutional logics. The managers’ concerns reveal that parental leave rights may clash with central values, goals and strategies in an organisation. Within the logics of the police and private law firms, work is more individualised and thus perceived as more challenging than in the public sector law offices. When the solution suggested by the managers is for individual employees to adapt their leave, gendered norms come forward. However, the analysis also shows that gendered parenthood norms play out differently with the different institutional logics. With these insights, the analysis shows how policy regulations and local workplace contexts interact in shaping the consequences of family policies for gender equality in wages and career progression