Se connecter

Bibliographies thématiques / Logic fibration

Sommaire

Articles de revues
Livres
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « Logic fibration »

Auteur : Grafiati

Publié le 2 juin 2025

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Logic fibration ».

À 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.

Articles de revues sur le sujet "Logic fibration"

1

HASUO, ICHIRO, TOSHIKI KATAOKA, and KENTA CHO. "Coinductive predicates and final sequences in a fibration." Mathematical Structures in Computer Science 28, no. 4 (2017): 562–611. http://dx.doi.org/10.1017/s0960129517000056.

Texte intégral

Résumé :

Coinductive predicates express persisting ‘safety’ specifications of transition systems. Previous observations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebras in a fibration – a categorical abstraction of predicate logic. In this paper, we follow the spirit of a seminal work by Worrell and study final sequences in a fibration. Our main contribution is to identify some categorical ‘size restriction’ axioms that guarantee stabilization of final sequences after ω steps. In its course, we develop a relevant categorical infrastructure that relates fibrations and l

Styles APA, Harvard, Vancouver, ISO, etc.

2

Termen, Talip Can, and Ozgur Ege. "Digital h-Fibrations and Some New Results on Digital Fibrations." Axioms 13, no. 3 (2024): 180. http://dx.doi.org/10.3390/axioms13030180.

Texte intégral

Résumé :

In this work, the notion of digital fiber homotopy is defined and its properties are given. We present some new results on digital fibrations. Moreover, we introduce digital h-fibrations. We prove some of the properties of these digital h-fibrations. We show that a digital fibration and a digital map p are fiber homotopic equivalent if and only if p is a digital h-fibration. Finally, we explore a relation between digital fibrations and digital h-fibrations.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Leifer, Ian, Flaviano Morone, Saulo D. S. Reis, José S. Andrade, Mariano Sigman, and Hernán A. Makse. "Circuits with broken fibration symmetries perform core logic computations in biological networks." PLOS Computational Biology 16, no. 6 (2020): e1007776. http://dx.doi.org/10.1371/journal.pcbi.1007776.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

NICOLAIDIS, A., and V. KIOSSES. "SPINOR GEOMETRY." International Journal of Modern Physics A 27, no. 22 (2012): 1250126. http://dx.doi.org/10.1142/s0217751x12501266.

Texte intégral

Résumé :

It has been proposed that quantum mechanics and string theory share a common inner syntax, the relational logic of C. S. Peirce. Along this line of thought we consider the relations represented by spinors. Spinor composition leads to the emergence of Minkowski space–time. Inversely, the Minkowski space–time is istantiated by the Weyl spinors, while the merger of two Weyl spinors gives rise to a Dirac spinor. Our analysis is applied also to the string geometry. The string constraints are represented by real spinors, which create a parametrization of the string worldsheet identical to the Ennepe

Styles APA, Harvard, Vancouver, ISO, etc.

5

Pagnan, Ruggero. "Concrete Fibrations." Notre Dame Journal of Formal Logic 58, no. 2 (2017): 179–204. http://dx.doi.org/10.1215/00294527-3817788.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Emmenegger, Jacopo, Fabio Pasquali, and Giuseppe Rosolini. "A characterisation of elementary fibrations." Annals of Pure and Applied Logic 173, no. 6 (2022): 103103. http://dx.doi.org/10.1016/j.apal.2022.103103.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Lamarche, François. "Multiplicative Linear Logics and Fibrations." Electronic Notes in Theoretical Computer Science 69 (February 2003): 227–47. http://dx.doi.org/10.1016/s1571-0661(04)80567-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

HALIMI, BRICE. "LOGICAL CONTEXTUALITY IN FREGE." Review of Symbolic Logic 11, no. 1 (2018): 1–20. http://dx.doi.org/10.1017/s1755020316000320.

Texte intégral

Résumé :

AbstractLogical universalism, a label that has been pinned on to Frege, involves the conflation of two features commonly ascribed to logic: universality and radicality. Logical universality consists in logic being about absolutely everything. Logical radicality, on the other hand, corresponds to there being the one and the same logic that any reasoning must comply with. The first part of this paper quickly remarks that Frege’s conception of logic makes logical universality prevail and does not preclude the admission of different contexts of discourse. The paper then aims to make it clear how F

Styles APA, Harvard, Vancouver, ISO, etc.

9

Makkai, M. "The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. II." Notre Dame Journal of Formal Logic 34, no. 4 (1993): 471–98. http://dx.doi.org/10.1305/ndjfl/1093633902.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Makkai, M. "The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. I." Notre Dame Journal of Formal Logic 34, no. 3 (1993): 334–77. http://dx.doi.org/10.1305/ndjfl/1093634727.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Logic fibration"

1

Pavlović, Duško. Predicates and fibrations: From type theoretical to category theoretical presentation of constructive logic. [s.n.], 1990.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Logic fibration"

1

Gaboardi, Marco, Shin-ya Katsumata, Dominic Orchard, and Tetsuya Sato. "Graded Hoare Logic and its Categorical Semantics." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_9.

Texte intégral

Résumé :

AbstractDeductive verification techniques based on program logics (i.e., the family of Floyd-Hoare logics) are a powerful approach for program reasoning. Recently, there has been a trend of increasing the expressive power of such logics by augmenting their rules with additional information to reason about program side-effects. For example, general program logics have been augmented with cost analyses, logics for probabilistic computations have been augmented with estimate measures, and logics for differential privacy with indistinguishability bounds. In this work, we unify these various approa

Styles APA, Harvard, Vancouver, ISO, etc.

2

Ghani, Neil, Patricia Johann, and Clément Fumex. "Fibrational Induction Rules for Initial Algebras." In Computer Science Logic. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15205-4_27.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Kinoshita, Y., and A. J. Power. "A fibrational semantics for logic programs." In Extensions of Logic Programming. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60983-0_12.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Kura, Satoshi. "A General Semantic Construction of Dependent Refinement Type Systems, Categorically." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_21.

Texte intégral

Résumé :

AbstractDependent refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type systems and predicate logic, that is, a construction of liftings of closed comprehension categories from given (underlying) closed comprehension categories and posetal fibrations for predicate logic. We give sufficient conditions to lift structures such as dependent products, dependent sums, computational effects, and recursion from the underlyi

Styles APA, Harvard, Vancouver, ISO, etc.

5

Lawvere, F. William. "Tools for the Advancement of Objective Logic: Closed Categories and Toposes." In The Logical Foundations of Cognition. Oxford University PressNew York, NY, 1994. http://dx.doi.org/10.1093/oso/9780195092158.003.0004.

Texte intégral

Résumé :

Abstract The thesis is that the explicit adequate development of the science of knowing will require the use of the mathematical theory of categories. Even within mathematical experience, only that theory has approximated a particular model of the general, sufficient as a foundation for a general account of all particulars. Arising 50 years ago from the needs of geometry, category theory has developed such notions as adjoint func•• tor, topos, fibration, closed category, 2-category, etc., in order to provide: (1) A guide to the complex, but very non-arbitrary constructions of the concepts and

Styles APA, Harvard, Vancouver, ISO, etc.

6

Marti-Oliet, Narciso, and Jose Meseguer. "An algebraic axiomatization of linear logic models." In Topology and Category Theory in Computer Science. Oxford University PressOxford, 1991. http://dx.doi.org/10.1093/oso/9780198537601.003.0013.

Texte intégral

Résumé :

Abstract There are many notions of type in computing. The most classical notion is ‘types as sets’, which has been extended to cover many features of modern programming languages. This chapter shows that such features are handled perhaps even more naturally by an extension of the ‘types as algebras’ notion to a ‘types as theories’ notion. This notion naturally supports object-oriented concepts, including inheritance and local state, as well as generic modules and dependent types. Moreover, it explains why polymorphic operations are natural transformations and provides a systematic foundation f

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Logic fibration"

1

Uemura, Taichi. "Fibred fibration categories." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005084.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Maillard, Kenji, and Paul-Andre Mellies. "A Fibrational Account of Local States." In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.45.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Bonchi, Filippo, Daniela Petrişan, Damien Pous, and Jurriaan Rot. "Coinduction up-to in a fibrational setting." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603149.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!