Conecte-se

Bibliografias temáticas / Higher order logics / Artigos de revistas

Siga este link para ver outros tipos de publicações sobre o tema: Higher order logics.

Artigos de revistas sobre o tema "Higher order logics"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 6 de fevereiro de 2022

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Higher order logics".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

1

Finkelstein, David. "Higher-order quantum logics." International Journal of Theoretical Physics 31, no. 9 (September 1992): 1627–38. http://dx.doi.org/10.1007/bf00671777.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Hella, Lauri, and José M. Turull-Torres. "Expressibility of Higher Order Logics." Electronic Notes in Theoretical Computer Science 84 (September 2003): 129–40. http://dx.doi.org/10.1016/s1571-0661(04)80850-8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Aguirre, Alejandro, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, and Tetsuya Sato. "Higher-order probabilistic adversarial computations: categorical semantics and program logics." Proceedings of the ACM on Programming Languages 5, ICFP (August 22, 2021): 1–30. http://dx.doi.org/10.1145/3473598.

Texto completo da fonte

Resumo:

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several domains, including security, privacy and machine learning. In this paper, we develop program logics for reasoning about adversarial computations in a higher-order setting. Our logics are built on top of a simply typed λ-calculus extended with a graded monad for probabilities and state. The grading is used to model and restrict the memory footprint and the cost

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Dal Lago, Ugo, Simone Martini, and Davide Sangiorgi. "Light Logics and Higher-Order Processes." Electronic Proceedings in Theoretical Computer Science 41 (November 28, 2010): 46–60. http://dx.doi.org/10.4204/eptcs.41.4.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

DAL LAGO, UGO, SIMONE MARTINI, and DAVIDE SANGIORGI. "Light logics and higher-order processes." Mathematical Structures in Computer Science 26, no. 6 (November 17, 2014): 969–92. http://dx.doi.org/10.1017/s0960129514000310.

Texto completo da fonte

Resumo:

We show that the techniques for resource control that have been developed by the so-calledlight logicscan be fruitfully applied also to process algebras. In particular, we present a restriction of higher-order π-calculus inspired by soft linear logic. We prove that any soft process terminates in polynomial time. We argue that the class of soft processes may be naturally enlarged so that interesting processes are expressible, still maintaining the polynomial bound on executions.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Hella, Lauri, and José María Turull-Torres. "Computing queries with higher-order logics." Theoretical Computer Science 355, no. 2 (April 2006): 197–214. http://dx.doi.org/10.1016/j.tcs.2006.01.009.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Crary, Karl. "Higher-order representation of substructural logics." ACM SIGPLAN Notices 45, no. 9 (September 27, 2010): 131–42. http://dx.doi.org/10.1145/1932681.1863565.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Benzmüller, Christoph, Dov Gabbay, Valerio Genovese, and Daniele Rispoli. "Embedding and automating conditional logics in classical higher-order logic." Annals of Mathematics and Artificial Intelligence 66, no. 1-4 (September 25, 2012): 257–71. http://dx.doi.org/10.1007/s10472-012-9320-z.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Andrews, James H. "An untyped higher order logic with Y combinator." Journal of Symbolic Logic 72, no. 4 (December 2007): 1385–404. http://dx.doi.org/10.2178/jsl/1203350794.

Texto completo da fonte

Resumo:

AbstractWe define a higher order logic which has only a notion of sort rather than a notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory, a proof system which is sound with respect to the model theory, and a cut-elimination proof for the proof system. We also give examples showing what formulas can and cannot be used in the logic.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Sági, Gábor. "A completeness theorem for higher order logics." Journal of Symbolic Logic 65, no. 2 (June 2000): 857–84. http://dx.doi.org/10.2307/2586575.

Texto completo da fonte

Resumo:

AbstractHere we investigate the classes of representable directed cylindric algebras of dimension α introduced by Németi [12]. can be seen in two different ways: first, as an algebraic counterpart of higher order logics and second, as a cylindric algebraic analogue of Quasi-Projective Relation Algebras. We will give a new, “purely cylindric algebraic” proof for the following theorems of Németi: (i) is a finitely axiomatizable variety whenever α ≥ 3 is finite and (ii) one can obtain a strong representation theorem for if one chooses an appropriate (non-well-founded) set theory as foundation of

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Steen, Alexander. "Higher-order theorem proving and its applications." it - Information Technology 61, no. 4 (August 27, 2019): 187–91. http://dx.doi.org/10.1515/itit-2019-0001.

Texto completo da fonte

Resumo:

Abstract Automated theorem proving systems validate or refute whether a conjecture is a logical consequence of a given set of assumptions. Higher-order provers have been successfully applied in academic and industrial applications, such as planning, software and hardware verification, or knowledge-based systems. Recent studies moreover suggest that automation of higher-order logic, in particular, yields effective means for reasoning within expressive non-classical logics, enabling a whole new range of applications, including computer-assisted formal analysis of arguments in metaphysics. My wor

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Benzmüller, Christoph. "Combining and automating classical and non-classical logics in classical higher-order logics." Annals of Mathematics and Artificial Intelligence 62, no. 1-2 (June 2011): 103–28. http://dx.doi.org/10.1007/s10472-011-9249-7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Mamdani, E. H., and H. J. Efstathiou. "Higher-order logics for handling uncertainty in expert systems." International Journal of Man-Machine Studies 22, no. 3 (March 1985): 283–93. http://dx.doi.org/10.1016/s0020-7373(85)80004-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

UMEZAWA, Toshio. "An extension of intermediate predicate logics to higher order." Japanese journal of mathematics. New series 17, no. 1 (1991): 37–55. http://dx.doi.org/10.4099/math1924.17.37.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Ferrarotti, Flavio Antonio, and José María Turull Torres. "Arity and alternation: a proper hierarchy in higher order logics." Annals of Mathematics and Artificial Intelligence 50, no. 1-2 (July 18, 2007): 111–41. http://dx.doi.org/10.1007/s10472-007-9071-4.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Zaionc, Marek. "On the λ Definable Higher Order Boolean Operations". Fundamenta Informaticae 12, № 2 (1 квітня 1989): 181–89. http://dx.doi.org/10.3233/fi-1989-12205.

Texto completo da fonte

Resumo:

The purpose of this work is to show the methods of representing higher order boolean functionals in the simple typed λ calculus. In the paper is presented an algorithm for construction the λ representation of a functional given by generalized truth table. This technique is useful especially in functional programming languages such as ML in which functionals are expressed in the form of typed λ terms. Also λ representability of higher order functionals in many valued logics is discussed.

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Doder, Dragan, Nenad Savić, and Zoran Ognjanović. "Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities." Journal of Logic, Language and Information 29, no. 1 (September 3, 2019): 77–107. http://dx.doi.org/10.1007/s10849-019-09301-7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Găină, Daniel, and Tomasz Kowalski. "Fraïssé–Hintikka theorem in institutions." Journal of Logic and Computation 30, no. 7 (September 3, 2020): 1377–99. http://dx.doi.org/10.1093/logcom/exaa042.

Texto completo da fonte

Resumo:

Abstract We generalize the characterization of elementary equivalence by Ehrenfeucht–Fraïssé games to arbitrary institutions whose sentences are finitary. These include many-sorted first-order logic, higher-order logic with types, as well as a number of other logics arising in connection to specification languages. The gain for the classical case is that the characterization is proved directly for all signatures, including infinite ones.

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Despeyroux, Joëlle, and Robert Harper. "Special issue on Logical Frameworks and Metalanguages http//www-sop.inria.fr/certilab/LFM00/cfp-jfp.html." Journal of Functional Programming 10, no. 1 (January 2000): 135–36. http://dx.doi.org/10.1017/s0956796899009892.

Texto completo da fonte

Resumo:

Logical frameworks and meta-languages are intended as a common substrate for representing and implementing a wide variety of logics and formal systems. Their definition and implementation have been the focus of considerable work over the last decade. At the heart of this work is a quest for generality: A logical framework provides a basis for capturing uniformities across deductive systems and support for implementing particular systems. Similarly a meta-language supports reasoning about and using languages.Logical frameworks have been based on a variety of different languages including higher

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

HUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (March 2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.

Texto completo da fonte

Resumo:

There is both a great unity and a great diversity in presentations of logic. The diversity is staggering indeed – propositional logic, first-order logic, higher-order logic belong to one classification; linear logic, intuitionistic logic, classical logic, modal and temporal logics belong to another one. Logical deduction may be presented as a Hilbert style of combinators, as a natural deduction system, as sequent calculus, as proof nets of one variety or other, etc. Logic, originally a field of philosophy, turned into algebra with Boole, and more generally into meta-mathematics with Frege and

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Kołodziejczyk, Leszek Aleksander. "Truth definitions in finite models." Journal of Symbolic Logic 69, no. 1 (March 2004): 183–200. http://dx.doi.org/10.2178/jsl/1080938836.

Texto completo da fonte

Resumo:

AbstractThe paper discusses the notion of finite model truth definitions (or FM-truth definitions), introduced by M. Mostowski as a finite model analogue of Tarski's classical notion of truth definition.We compare FM-truth definitions with Vardi's concept of the combined complexity of logics, noting an important difference: the difficulty of defining FM-truth for a logic does not depend on the syntax of , as long as it is decidable. It follows that for a natural there exist FM-truth definitions whose evaluation is much easier than the combined complexly of would suggest.We apply the general th

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Okada, Mitsuhiro. "A uniform semantic proof for cut-elimination and completeness of various first and higher order logics." Theoretical Computer Science 281, no. 1-2 (June 2002): 471–98. http://dx.doi.org/10.1016/s0304-3975(02)00024-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Conrath-Hargreaves, Annemarie, and Sonja Wüstemann. "Multiple institutional logics and their impact on accounting in higher education." Accounting, Auditing & Accountability Journal 32, no. 3 (March 18, 2019): 782–810. http://dx.doi.org/10.1108/aaaj-08-2017-3095.

Texto completo da fonte

Resumo:

Purpose The purpose of this paper is to explore how an Higher Education Institution’s (HEI) choice of undergoing a voluntary reorganisation, motivated by its own interest of increasing its autonomy, whilst also having to satisfy the government in order to maintain the level of public funding, impacts on the HEI’s accounting. Design/methodology/approach The paper draws on the institutional logics perspective to present a single case study of a German HEI that chose to be reorganised from a public into a foundation university. Data were obtained using multiple data collection methods. Findings T

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Gürses, Serdal, and Ali Danışman. "Keeping institutional logics in arm’s length: emerging of rogue practices in a gray zone of everyday work life in healthcare." Journal of Professions and Organization 8, no. 2 (July 1, 2021): 128–67. http://dx.doi.org/10.1093/jpo/joab004.

Texto completo da fonte

Resumo:

Abstract We set out to explore the practice-level cognitive structures and associated practices characterizing the daily routine work of physicians by conducting a qualitative study in the Turkish healthcare field, in which a recent government-led healthcare reform was implemented causing logic multiplicity. Contrary to the accumulated knowledge in institutional logics literature, a bulk of which suggests that actors craft and enact various practices in managing plural and at times conflicting institutional templates strictly within the confines of higher order societal logics, this study show

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

KIRCHNER, DANIEL, CHRISTOPH BENZMÜLLER, and EDWARD N. ZALTA. "MECHANIZING PRINCIPIA LOGICO-METAPHYSICA IN FUNCTIONAL TYPE-THEORY." Review of Symbolic Logic 13, no. 1 (July 12, 2019): 206–18. http://dx.doi.org/10.1017/s1755020319000297.

Texto completo da fonte

Resumo:

AbstractPrincipia Logico-Metaphysica contains a foundational logical theory for metaphysics, mathematics, and the sciences. It includes a canonical development of Abstract Object Theory [AOT], a metaphysical theory (inspired by ideas of Ernst Mally, formalized by Zalta) that distinguishes between ordinary and abstract objects.This article reports on recent work in which AOT has been successfully represented and partly automated in the proof assistant system Isabelle/HOL. Initial experiments within this framework reveal a crucial but overlooked fact: a deeply-rooted and known paradox is reintro

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Chlipala, Adam. "Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl)." Proceedings of the ACM on Programming Languages 5, ICFP (August 22, 2021): 1–28. http://dx.doi.org/10.1145/3473599.

Texto completo da fonte

Resumo:

Rigorous reasoning about programs calls for some amount of bureaucracy in managing details like variable binding, but, in guiding students through big ideas in semantics, we might hope to minimize the overhead. We describe our experiment introducing a range of such ideas, using the Coq proof assistant, without any explicit representation of variables, instead using a higher-order syntax encoding that we dub "mixed embedding": it is neither the fully explicit syntax of deep embeddings nor the syntax-free programming of shallow embeddings. Marquee examples include different takes on concurrency

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Schmidt, Dennis R. "Peremptory law, global order, and the normative boundaries of a pluralistic world." International Theory 8, no. 2 (May 5, 2016): 262–96. http://dx.doi.org/10.1017/s175297191600004x.

Texto completo da fonte

Resumo:

This article develops a socio-legal approach to theorizing the construction of peremptory norms in international relations. It argues that due to its focus on formalism and abstract notions of rights, traditional legal treatments have failed to acknowledge the socially constructed nature of higher order norms. To address this shortcoming, the article transfers the concept ofjus cogensinto the realm of International Relations. Drawing on insights from constructivism and English School theory, it situates law in the context of society and conceptualizesjus cogensas part of international society’

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Niestegge, Gerd. "Conditional Probability, Three-Slit Experiments, and the Jordan Algebra Structure of Quantum Mechanics." Advances in Mathematical Physics 2012 (2012): 1–20. http://dx.doi.org/10.1155/2012/156573.

Texto completo da fonte

Resumo:

Most quantum logics do not allow for a reasonable calculus of conditional probability. However, those ones which do so provide a very general and rich mathematical structure, including classical probabilities, quantum mechanics, and Jordan algebras. This structure exhibits some similarities with Alfsen and Shultz's noncommutative spectral theory, but these two mathematical approaches are not identical. Barnum, Emerson, and Ududec adapted the concept of higher-order interference, introduced by Sorkin in 1994, into a general probabilistic framework. Their adaption is used here to reveal a close

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

BARBERO, FAUSTO. "SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION." Review of Symbolic Logic 12, no. 3 (April 12, 2019): 456–86. http://dx.doi.org/10.1017/s1755020319000145.

Texto completo da fonte

Resumo:

AbstractWe analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engström, comparing them with a more general, higher order definition of team quantifier. We show that Engström’s definitions (and other quantifiers from the literature) can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engström’s quantifiers only range over the latter. We further argue that Engström’s definitions are

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Jacinto, Bruno. "Necessitism, Contingentism, and Theory Equivalence." Bulletin of Symbolic Logic 27, no. 2 (June 2021): 217–18. http://dx.doi.org/10.1017/bsl.2021.25.

Texto completo da fonte

Resumo:

AbstractNecessitism, Contingentism, and Theory Equivalence is a dissertation on issues in higher-order modal metaphysics. Consider a modal higher-order language with identity in which the universal quantifier is interpreted as expressing (unrestricted) universal quantification and the necessity operator is interpreted as expressing metaphysical necessity. The main question addressed in the dissertation concerns the correct theory formulated in this language. A different question that also takes centre stage in the dissertation is what it takes for theories to be equivalent.The whole dissertati

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Larsen, Katarina. "Managing the complexity of centres of excellence: accommodating diversity in institutional logics." Tertiary Education and Management 26, no. 3 (December 6, 2019): 295–310. http://dx.doi.org/10.1007/s11233-019-09053-w.

Texto completo da fonte

Resumo:

AbstractThis article discusses how Centres of Excellence (CoE) and the existence of several logics in these centres can contribute to the differentiation of the strategic profiles of universities. The study sees research centres as a way to organize research activities in Higher Education Institutions (HEIs) in order to target both excellence but also societal challenges through focused thematic research. It reveals how societal challenges and their interpretation by these centres contribute to the differentiation of the strategic profiles of universities. Studies of centres of excellence prog

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Diab, Ahmed, and Ahmed Aboud. "The interplay between ideological resistance and management control: an Egyptian case study." Journal of Accounting in Emerging Economies 9, no. 2 (May 7, 2019): 208–36. http://dx.doi.org/10.1108/jaee-07-2017-0070.

Texto completo da fonte

Resumo:

Purpose This study explores the relationship between institutional logics and workers’ agency in business organisations. The purpose of this paper is to explain management control in a complex setting of workers’ resistance and institutional multiplicity and complexity. Exploring the inherent political volatility at the macro level, the work also investigates the political aspects of economic organisations and the intermediary role of individuals who deal with these institutions. Design/methodology/approach Theoretically, the study triangulates institutional logics and labour process theories,

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Diab, Ahmed, and Abdelmoneim Bahyeldin Mohamed Metwally. "Institutional complexity and CSR practices: evidence from a developing country." Journal of Accounting in Emerging Economies 10, no. 4 (September 17, 2020): 655–80. http://dx.doi.org/10.1108/jaee-11-2019-0214.

Texto completo da fonte

Resumo:

PurposeThe study aims to investigate the appearance of corporate social and environmental responsibility (CSER) practices in a context where economic, communal and political institutions are highly central and competing with each other.Design/methodology/approachTheoretically, the study draws upon the institutional logics perspective and the theoretical concepts of logics centrality and compatibility to understand how higher-order institutions interact with mundane CSER practices observed at the case company's micro level. Empirical data were solicited in an Egyptian village community, where f

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Hodes, Harold. "Cardinality logics. Part II: Definability in languages based on ‘exactly’." Journal of Symbolic Logic 53, no. 3 (September 1988): 765–84. http://dx.doi.org/10.2307/2274570.

Texto completo da fonte

Resumo:

This paper continues the project initiated in [5]: a model-theoretic study of the concept of cardinality within certain higher-order logics. As recommended by an editor of this Journal, I will digress to say something about the project's motivation. Then I will review some of the basic definitions from [5]; for unexplained notation the reader should consult [5].The syntax of ordinary usage (with respect to the construction of arguments as well as the construction of individual sentences) makes it natural to classify numerals and expressions of the form ‘the number of F's’ as singular terms, ex

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Diab, Ahmed Abdelnaby Ahmed, and Abdelmoneim Bahyeldin Mohamed Metwally. "Institutional ambidexterity and management control." Qualitative Research in Accounting & Management 16, no. 3 (August 5, 2019): 373–402. http://dx.doi.org/10.1108/qram-08-2017-0081.

Texto completo da fonte

Resumo:

Purpose The purpose of this study is to investigate in depth how an organisation is able to achieve its economic objectives in a situation of institutional complexity through being institutionally dexterous. The study also investigates how this is done through overriding formal controls and concentrating on socio-political and communal-based controls. Design/methodology/approach Theoretically, the study draws on the perspectives of institutional complexity and ambidexterity to link higher-order institutions with mundane labour control practices observed at the micro level of the case company.

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Aschieri, Federico, Stefan Hetzl, and Daniel Weller. "Expansion trees with cut." Mathematical Structures in Computer Science 29, no. 8 (September 2019): 1009–29. http://dx.doi.org/10.1017/s0960129519000069.

Texto completo da fonte

Resumo:

AbstractHerbrand’s theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher-order logics by recording the information of which instances have been chosen for which quantifiers. This compact representation is known in the literature as Miller’s expansion tree proof. It is inherently analytic and hence corresponds to a cut-free sequent calculus proof. Recently several extensions of such proof representations to proofs with cuts have been proposed. These extensions are based on graphic

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Carrington, Thomas, Tobias Johansson, Gustav Johed, and Peter Öhman. "An Empirical Test of the Hierarchical Construct of Professionalism and Managerialism in the Accounting Profession." Behavioral Research in Accounting 25, no. 2 (May 1, 2013): 1–20. http://dx.doi.org/10.2308/bria-50511.

Texto completo da fonte

Resumo:

ABSTRACT: Research into the tension between professionalism and commercialism in the accounting profession is inconclusive and warrants greater attention. How to conceptualize and measure these constructs are thus pressing concerns. Using questionnaire data from 1,646 auditors in Sweden, and applying confirmatory factor analysis and structural regression models within a structural equation modeling framework to a measurement model developed by Suddaby et al. (2009), we find little empirical evidence for the existence of the two logics of professionalism and managerialism (i.e., commercialism)

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Wilson, Steven R., Kai Kuang, Elizabeth A. Hintz, and Patrice M. Buzzanell. "Developing and Validating the Communication Resilience Processes Scale." Journal of Communication 71, no. 3 (April 19, 2021): 478–513. http://dx.doi.org/10.1093/joc/jqab013.

Texto completo da fonte

Resumo:

Abstract According to the communication theory of resilience (CTR; P. M. Buzzanell, 2010), people reintegrate from disruptive events and construct a new normal through five interrelated processes: (a) crafting normalcy; (b) affirming identity anchors; (c) maintaining/using communication networks; (d) constructing alternative logics; and (e) foregrounding productive action while backgrounding negative emotions. Enacting these processes creates tensions between continuity and change. This article develops a Communication Resilience Processes Scale (CRPS) to assess CTR processes in response to a

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

BOVE, ANA, ALEXANDER KRAUSS, and MATTHIEU SOZEAU. "Partiality and recursion in interactive theorem provers – an overview." Mathematical Structures in Computer Science 26, no. 1 (November 10, 2014): 38–88. http://dx.doi.org/10.1017/s0960129514000115.

Texto completo da fonte

Resumo:

The use of interactive theorem provers to establish the correctness of critical parts of a software development or for formalizing mathematics is becoming more common and feasible in practice. However, most mature theorem provers lack a direct treatment of partial and general recursive functions; overcoming this weakness has been the objective of intensive research during the last decades. In this article, we review several techniques that have been proposed in the literature to simplify the formalization of partial and general recursive functions in interactive theorem provers. Moreover, we c

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Bruce, Kim, Johan van Benthem, and Kees Doets. "Higher-order Logic." Journal of Symbolic Logic 54, no. 3 (September 1989): 1090. http://dx.doi.org/10.2307/2274769.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Di Pinto, Floriana, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. "Acquiring Ontology Axioms through Mappings to Data Sources." Future Internet 11, no. 12 (December 13, 2019): 260. http://dx.doi.org/10.3390/fi11120260.

Texto completo da fonte

Resumo:

Although current languages used in ontology-based data access (OBDA) systems allow for mapping source data to instances of concepts and relations in the ontology, several application domains need more flexible tools for inferring knowledge from data, which are able to dynamically acquire axioms about new concepts and relations directly from the data. In this paper we introduce the notion of mapping-based knowledge base (MKB) to formalize the situation where both the extensional and the intensional level of the ontology are determined by suitable mappings to a set of data sources. This allows f

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Došen, Kosta. "Sequent-systems for modal logic." Journal of Symbolic Logic 50, no. 1 (March 1985): 149–68. http://dx.doi.org/10.2307/2273797.

Texto completo da fonte

Resumo:

AbstractThe purpose of this work is to present Gentzen-style formulations of S5 and S4 based on sequents of higher levels. Sequents of level 1 are like ordinary sequents, sequents of level 2 have collections of sequents of level 1 on the left and right of the turnstile, etc. Rules for modal constants involve sequents of level 2, whereas rules for customary logical constants of first-order logic with identity involve only sequents of level 1. A restriction on Thinning on the right of level 2, which when applied to Thinning on the right of level 1 produces intuitionistic out of classical logic (

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Forster, Thomas. "A Consistent Higher-Order Theory Without a (Higher-Order) Model." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35, no. 5 (1989): 385–86. http://dx.doi.org/10.1002/malq.19890350502.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Puga, Leila Z., and Newton C. A. Da Costa. "Sobre a lógica deôntica não-clássica." Crítica (México D. F. En línea) 19, no. 55 (December 10, 1987): 19–37. http://dx.doi.org/10.22201/iifs.18704905e.1987.639.

Texto completo da fonte

Resumo:

Our starting point, in this basically expository paper, is the study of a classical system of deontic propositional logic, classical in the sense that it constitutes an extension of the classical propositional calculus. It is noted, then, that the system excludes ab initio the possibility of the existence of real moral dilemmas (contradictory obligations and prohibitions), and also can not cope smoothly with the so-called prima facie moral dilemmas. So, we develop a non-classical, paraconsistent system of propositional deontic logic which is compatible with such dilemmas, real or prima facie.

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Davis, Alexander K. "Toward Exclusion through Inclusion: Engendering Reputation with Gender-Inclusive Facilities at Colleges and Universities in the United States, 2001-2013." Gender & Society 32, no. 3 (April 4, 2018): 321–47. http://dx.doi.org/10.1177/0891243218763056.

Texto completo da fonte

Resumo:

Ample sociological evidence demonstrates that binary gender ideologies are an intractable part of formal organizations and that transgender issues tend to be marginalized by a wide range of social institutions. Yet, in the last 15 years, more than 200 colleges and universities have attempted to ameliorate such realities by adopting gender-inclusive facilities in which students of any gender can share residential and restroom spaces. What cultural logics motivate these transformations? How can their emergence be reconciled with the difficulty of altering the gender order? Using an original samp

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Audenaert, Pieter. "The Higher-Order-Logic Formath." Bulletin of the Belgian Mathematical Society - Simon Stevin 15, no. 2 (May 2008): 335–67. http://dx.doi.org/10.36045/bbms/1210254829.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Charalambidis, Angelos, Konstantinos Handjopoulos, Panagiotis Rondogiannis, and William W. Wadge. "Extensional Higher-Order Logic Programming." ACM Transactions on Computational Logic 14, no. 3 (August 2013): 1–40. http://dx.doi.org/10.1145/2499937.2499942.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Czajka, Łukasz. "Higher-Order Illative Combinatory Logic." Journal of Symbolic Logic 78, no. 3 (September 2013): 837–72. http://dx.doi.org/10.2178/jsl.7803080.

Texto completo da fonte

Resumo:

AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Cropper, Andrew, Rolf Morel, and Stephen Muggleton. "Learning higher-order logic programs." Machine Learning 109, no. 7 (December 3, 2019): 1289–322. http://dx.doi.org/10.1007/s10994-019-05862-7.

Texto completo da fonte

Resumo:

AbstractA key feature of inductive logic programming is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher-order programs by allowing for higher-order definitions to be used as background knowledge. Our theoretical results show that learning higher-order programs, rather than first-order programs, can reduce the textual complexity required to express programs, which in turn reduces

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Hetzl, Stefan, Alexander Leitsch, and Daniel Weller. "CERES in higher-order logic." Annals of Pure and Applied Logic 162, no. 12 (December 2011): 1001–34. http://dx.doi.org/10.1016/j.apal.2011.06.005.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!