Accedi

Bibliografie tematiche / Higher order logics / Tesi

Segui questo link per vedere altri tipi di pubblicazioni sul tema: Higher order logics.

Tesi sul tema "Higher order logics"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 6 febbraio 2022

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Higher order logics".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.

1

Assaf, Ali. "A framework for defining computational higher-order logics." Palaiseau, Ecole polytechnique, 2015. https://theses.hal.science/tel-01235303v4/document.

Testo completo

Abstract (sommario):

The main aim of this thesis is to make formal proofs more universal by expressing them in a common logical framework. More specifically, we use the lambda-Pi-calculus modulo rewriting, a lambda calculus equipped with dependent types and term rewriting, as a language for defining logics and expressing proofs in those logics. By representing propositions as types and proofs as programs in this language, we design translations of various systems in a way that is efficient and that preserves their meaning. These translations can then be used for independent proof checking and proof interoperabilit

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Freire, Cibele Matos. "Complexidade descritiva das lÃgicas de ordem superior com menor ponto fixo e anÃlise de expressividade de algumas lÃgicas modais." Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=6359.

Testo completo

Abstract (sommario):

Em Complexidade Descritiva investigamos o uso de logicas para caracterizar classes problemas pelo vies da complexidade. Desde 1974, quando Fagin provou que NP e capturado pela logica existencial de segunda-ordem, considerado o primeiro resultado da area, outras relac~oes entre logicas e classes de complexidade foram estabelecidas. Os resultados mais conhecidos normalmemte envolvem logica de primeira-ordem e suas extens~oes, e classes de complexidade polinomiais em tempo ou espaco. Alguns exemplos sÃo que a logica de primeira-ordem estendida com o operador de menor ponto xo captura a clsse P e

Gli stili APA, Harvard, Vancouver, ISO e altri

3

TEICA, ELENA. "FORMAL CORRECTNESS AND COMPLETENESS FOR A SET OF UNINTERPRETED RTL TRANSFORMATIONS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1001432470.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Freire, Cibele Matos. "Complexidade descritiva das lógicas de ordem superior com menor ponto fixo e análise de expressividade de algumas lógicas modais." reponame:Repositório Institucional da UFC, 2010. http://www.repositorio.ufc.br/handle/riufc/17668.

Testo completo

Abstract (sommario):

Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-14T19:46:59Z No. of bitstreams: 1 2010_dis_cmfreire.pdf: 426798 bytes, checksum: 4ad13c09839833ee22b0396a445e8a26 (MD5)<br>Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-14T19:48:16Z (GMT) No. of bitstreams: 1 2010_dis_cmfreire.pdf: 426798 bytes, checksum: 4ad13c09839833ee22b0396a445e8a26 (MD5)<br>Made available in DSpace on 2016-06-14T19:48:16Z (GMT). No. of bitstreams: 1 2010_dis_cmfreire.pdf: 426798 bytes, checksum: 4ad13c09839833ee22b0396a445e8a26 (MD5) Previous issue date: 2010<br>In Descr

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Krishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.

Testo completo

Abstract (sommario):

In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. To do this, I develop a model higher-order imperative programming language, and develop a program logic for it. I demonstrate the power of my program logic by verifying a series of examples. This includes both realistic patterns of higher-order imperative programming such as the subject-observer pattern, as well as examples demonstrating the use of higher-order logic to reason modularly about highly aliased data structures such as

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Zardini, Elia. "Living on the slippery slope : the nature, sources and logic of vagueness." Thesis, St Andrews, 2008. http://hdl.handle.net/10023/508.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Nesi, Monica. "Formalising process calculi in higher order logic." Thesis, University of Cambridge, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627495.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Camilleri, Albert John. "Executing behavioural definitions in Higher Order Logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.232795.

Testo completo

Abstract (sommario):

Over the past few years, computer scientists have been using formal verification techniques to show the correctness of digital systems. The verification process, however, is complicated and expensive. Even proofs of simple circuits can involve thousands of logical steps. Often it can be extremely difficult to find correct device specifications and it is desirable that one sets off to prove a correct specification from the start, rather than repeatedly backtrack from the verification process to modify the original definitions after discovering they were incorrect or inaccurate. The main idea pr

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Sultana, Nikolai. "Higher-order proof translation." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/247345.

Testo completo

Abstract (sommario):

The case for interfacing logic tools together has been made countless times in the literature, but it is still an important research question. There are various logics and respective tools for carrying out formal developments, but practitioners still lament the difficulty of reliably exchanging mathematical data between tools. Writing proof-translation tools is hard. The problem has both a theoretical side (to ensure that the translation is adequate) and a practical side (to ensure that the translation is feasible and usable). Moreover, the source and target proof formats might be less documen

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Fritz, Peter. "Intensional type theory for higher-order contingentism." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd.

Testo completo

Abstract (sommario):

Things could have been different, but could it also have been different what things there are? It is natural to think so, since I could have failed to be born, and it is natural to think that I would then not have been anything. But what about entities like propositions, properties and relations? Had I not been anything, would there have been the property of being me? In this thesis, I formally develop and assess views according to which it is both contingent what individuals there are and contingent what propositions, properties and relations there are. I end up rejecting these views, and con

Gli stili APA, Harvard, Vancouver, ISO e altri

11

Haftmann, Florian. "Code generation from specifications in higher-order logic." kostenfrei, 2009. https://mediatum2.ub.tum.de/node?id=886023.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

12

Cardell-Oliver, Rachel Mary. "The formal verification of hard real-time systems." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239756.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

13

Berghofer, Stefan. "Proofs, programs and executable specifications in higher order logic." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969627661.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

14

Bruse, Florian [Verfasser]. "Extremal fixpoints for higher-order modal logic / Florian Bruse." Kassel : Universitätsbibliothek Kassel, 2020. http://d-nb.info/1220854093/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

15

Grellois, Charles. "Semantics of linear logic and higher-order model-checking." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC024.

Testo completo

Abstract (sommario):

Dans cette thèse, nous envisageons des problèmes de model-checking d'ordre supérieur à l'aide d'approches issues de la sémantique et de la logique. Le model-checking d'ordre supérieur étudie la vérification de propriétés, exprimées en logique monadique du second ordre, sur des arbres infinis générés par une classe de systèmes de réécriture appelés schémas de récursion d'ordre supérieur. Ces systèmes sont équivalents au lambda-calcul simplement typé avec récursion, et peuvent donc être étudiés à l'aide d'outils sémantiques. Plus précisément, l'objet de cette thèse est de relier le model-checkin

Gli stili APA, Harvard, Vancouver, ISO e altri

16

Dhingra, Inderpreet Singh. "Formalising an integrated circuit design style in higher order logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278296.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

17

Melham, Thomas Frederick. "Formalizing abstraction mechanisms for hardware verification in higher order logic." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334206.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

18

Gilbert, Frédéric. "Extending higher-order logic with predicate subtyping : application to PVS." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC009/document.

Testo completo

Abstract (sommario):

Le système de types de la logique d'ordre supérieur permet d'exclure certaines expressions indésirables telles que l'application d'un prédicat à lui-même. Cependant, il ne suffit pas pour vérifier des critères plus complexes comme l'absence de divisions par zéro. Cette thèse est consacrée à l’étude d’une extension de la logique d’ordre supérieur appelée sous-typage par prédicats (predicate subtyping), dont l'objet est de rendre l'attribution de types aussi expressive que l'attribution de prédicats. A partir d'un type A et d'un prédicat P(x) de domaine A, le sous-typage par prédicats permet de

Gli stili APA, Harvard, Vancouver, ISO e altri

19

Pandya, Rashmibala. "A multi-layered framework for higher order probabilistic reasoning." Thesis, University of Exeter, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364432.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

20

Miura, Kinya. "Proof System of Higher-Order Clausal Logic and its Parallel Implementation." Kyoto University, 1995. http://hdl.handle.net/2433/160754.

Testo completo

Abstract (sommario):

本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである<br>Kyoto University (京都大学)<br>0048<br>新制・論文博士<br>博士(工学)<br>乙第8773号<br>論工博第2935号<br>新制||工||978(附属図書館)<br>UT51-95-B238<br>(主査)教授堂下修司, 教授矢島脩三, 教授石田亨<br>学位規則第4条第2項該当

Gli stili APA, Harvard, Vancouver, ISO e altri

21

Martin, Alan J. "Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study." Thesis, Université d'Ottawa / University of Ottawa, 2010. http://hdl.handle.net/10393/19711.

Testo completo

Abstract (sommario):

We present a series of improvements to the Hybrid system, a formal theory implemented in Isabelle/HOL to support specifying and reasoning about formal systems using higher-order abstract syntax (HOAS). We modify Hybrid's type of terms, which is built definitionally in terms of de Bruijn indices, to exclude at the type level terms with `dangling' indices. We strengthen the injectivity property for Hybrid's variable-binding operator, and develop rules for compositional proof of its side condition, avoiding conversion from HOAS to de Bruijn indices. We prove representational adequacy of Hybrid

Gli stili APA, Harvard, Vancouver, ISO e altri

22

Battell, Chelsea. "The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35264.

Testo completo

Abstract (sommario):

Hybrid is a two-level logical framework that supports higher-order abstract syntax (HOAS), where a specification logic (SL) extends the class of object logics (OLs) we can reason about. We develop a new Hybrid SL and formalize its metatheory, proving weakening, contraction, exchange, and cut admissibility; results that greatly simplify reasoning about OLs in systems providing HOAS. The SL is a sequent calculus defined as an inductive type in Coq and we prove properties by structural induction over SL sequents. We also present a generalized SL and metatheory statement, allowing us to prove ma

Gli stili APA, Harvard, Vancouver, ISO e altri

23

Ng, Kee Siong, and kee siong@rsise anu edu au. "Learning Comprehensible Theories from Structured Data." The Australian National University. Research School of Information Sciences and Engineering, 2005. http://thesis.anu.edu.au./public/adt-ANU20051031.105726.

Testo completo

Abstract (sommario):

This thesis is concerned with the problem of learning comprehensible theories from structured data and covers primarily classification and regression learning. The basic knowledge representation language is set around a polymorphically-typed, higher-order logic. The general setup is closely related to the learning from propositionalized knowledge and learning from interpretations settings in Inductive Logic Programming. Individuals (also called instances) are represented as terms in the logic. A grammar-like construct called a predicate rewrite system is used to define features in the for

Gli stili APA, Harvard, Vancouver, ISO e altri

24

Kotzsch, Hans-Christoph [Verfasser], and Hannes [Akademischer Betreuer] Leitgeb. "Topos semantics for higher-order modal logic / Hans-Christoph Kotzsch ; Betreuer: Hannes Leitgeb." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2016. http://d-nb.info/1125883928/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

25

Mukhopadhyay, Trisha. "A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7862.

Testo completo

Abstract (sommario):

Automated Theorem Provers (ATP) are software programs which carry out inferences over logico-mathematical systems, often with the goal of finding proofs to some given theorem. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. Currently, many automated theorem provers exist like E, vampire, SPASS, ACL2, Coq etc. However, all the available theorem provers have some common problems: (1) Current ATP systems tend not to try to find proofs entirely on their own. They need help from human experts to supply lemmas, guide the proof, etc. (2) There i

Gli stili APA, Harvard, Vancouver, ISO e altri

26

Atzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.

Testo completo

Abstract (sommario):

This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known proble

Gli stili APA, Harvard, Vancouver, ISO e altri

27

Reynolds, James. "An automatic proof-generating translation from higher-order to first-order logic : with applications to linking HOL4 and ACL2." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611133.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

28

Kohlhase, Michael [Verfasser]. "A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle / Michael Kohlhase." Kaiserslautern : Technische Universität Kaiserslautern, Fachbereich Informatik, 1999. http://d-nb.info/1027386598/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

29

Bulwahn, Lukas [Verfasser], Tobias [Akademischer Betreuer] Nipkow, and Colin [Akademischer Betreuer] Runciman. "Counterexample Generation for Higher-Order Logic Using Functional and Logic Programming / Lukas Bulwahn. Gutachter: Tobias Nipkow ; Colin Runciman. Betreuer: Tobias Nipkow." München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1033891142/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

30

Sofianatos, Georgios. "Higher order QCD effects for Higgs boson studies at colliders /." May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

31

Böhme, Sascha Verfasser], Tobias [Akademischer Betreuer] [Nipkow, and Andrey [Akademischer Betreuer] Rybalchenko. "Proving Theorems of Higher-Order Logic with SMT Solvers / Sascha Böhme. Gutachter: Andrey Rybalchenko. Betreuer: Tobias Nipkow." München : Universitätsbibliothek der TU München, 2012. http://d-nb.info/1023128497/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

32

Kohlhase, Michael [Verfasser], and Jörg [Akademischer Betreuer] Siekmann. "A mechanization of sorted higher-order logic based on the resolution principle / Michael Kohlhase. Betreuer: Jörg Siekmann." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2007. http://d-nb.info/1049538501/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

33

Carreno, Coll Victor Alberto. "Transition assertions : a higher-order logic based method for the specification and verification of real-time systems." Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627145.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

34

Wong, Wai. "A formal theory of railway track networks in higher-order logic and its applications in interlocking design." Thesis, University of Warwick, 1992. http://wrap.warwick.ac.uk/110541/.

Testo completo

Abstract (sommario):

The research described in this dissertation centres on the application of a discipline of formal methods in railway signalling system design. A generic abstract model of railway track networks and signals has been developed in Higher-Order Logic(HOL). It consists of several theories arranged in a hierarchy. Railway track networks are modelled by a class of constraint labelled directed graphs. HOL theories of graphs and paths have been developed for representing track networks. HOL theories modelling individual track components and signals have also been developed. These theories are then combi

Gli stili APA, Harvard, Vancouver, ISO e altri

35

Anglès, d'Auriac Paul-Elliot. "Infinite Computations in Algorithmic Randomness and Reverse Mathematics." Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC0061.

Testo completo

Abstract (sommario):

Cette thèse se concentre sur l'apport du calcul en temps infini à la logique mathématique. Le calcul en temps infini est une variante de la traditionnelle définition du calcul comme suite finie d'étapes, chaque étape étant définie à partir des précédentes, et aboutissant à un état final. Dans le cas de cette thèse, nous considérons le cas où le nombre d'étapes n'est pas forcément fini, mais peut continuer le long des ordinaux, une extension des entiers. Il existe plusieurs manières d'implémenter cette idée, nous en utilisons trois : la calculabilité d'ordre supérieur, les machines de Turing à

Gli stili APA, Harvard, Vancouver, ISO e altri

36

Raghunandan, Jayshan. "Curry-Howard Calculi from Classical Logical Connectives : A Generic Tool for Higher-Order Term Graph Rewriting." Thesis, Imperial College London, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.508781.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

37

Blanchette, Jasmin Christian Verfasser], Tobias [Akademischer Betreuer] [Nipkow, and Koen [Akademischer Betreuer] Claessen. "Automatic Proofs and Refutations for Higher-Order Logic / Jasmin Christian Blanchette. Gutachter: Tobias Nipkow ; Koen Claessen. Betreuer: Tobias Nipkow." München : Universitätsbibliothek der TU München, 2012. http://d-nb.info/1024354997/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

38

Blanchette, Jasmin [Verfasser], Tobias [Akademischer Betreuer] Nipkow, and Koen [Akademischer Betreuer] Claessen. "Automatic Proofs and Refutations for Higher-Order Logic / Jasmin Christian Blanchette. Gutachter: Tobias Nipkow ; Koen Claessen. Betreuer: Tobias Nipkow." München : Universitätsbibliothek der TU München, 2012. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20120628-1097834-1-6.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

39

Dubcová, Lenka. "Novel self-adaptive higher-order finite elements methods for Maxwell's equations of electromagnetics." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

40

Wisnesky, Ryan. "Functional Query Languages with Categorical Types." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11288.

Testo completo

Abstract (sommario):

We study three category-theoretic types in the context of functional query languages (typed lambda-calculi extended with additional operations for bulk data processing). The types we study are:<br>Engineering and Applied Sciences

Gli stili APA, Harvard, Vancouver, ISO e altri

41

Kunčar, Ondřej Verfasser], Tobias [Akademischer Betreuer] [Gutachter] [Nipkow, and Lawrence C. [Gutachter] Paulson. "Types, Abstraction and Parametric Polymorphism in Higher-Order Logic / Ondřej Kunčar. Betreuer: Tobias Nipkow. Gutachter: Lawrence C. Paulson ; Tobias Nipkow." München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1106382153/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

42

Tian, Chun. "A formalization of unique solutions of equations in process algebra." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14798/.

Testo completo

Abstract (sommario):

In this thesis, a comprehensive formalization of Milner's Calculus of Communicating Systems (also known as CCS) has been done in HOL theorem prover (HOL4), based on an old work in HOL88. This includes all classical properties of strong/weak bisimulation equivalences and observation congruence, a theory of congruence for CCS, various versions of ``bisimulation up to'' techniques, and several deep theorems, namely the ``coarsest congruence contained in weak equivalence'', and three versions of the ``unique solution of equations'' theorem in Milner's book. This work is further extended to supp

Gli stili APA, Harvard, Vancouver, ISO e altri

43

Sbardolini, Giorgio. "From Language to Thought: On the Logical Foundations of Semantic Theory." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu155307880402531.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

44

Bacon, Andrew Jonathan. "Indeterminacy : an investigation into the Soritical and semantical paradoxes." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b4490a8c-0089-4c77-8d24-1ab1ca5baaf0.

Testo completo

Abstract (sommario):

According to orthodoxy the study of the Soritical and semantical paradoxes belongs to the domain of the philosophy of language. To solve these paradoxes we need to investigate the nature of words like `heap' and `true.' In this thesis I criticise linguistic explanations of the state of ignorance we find ourselves in when confronted with indeterminate cases and develop a classical non-linguistic theory of indeterminacy in its stead. The view places the study of vagueness and indeterminacy squarely in epistemological terms, situating it within a theory of rational propositional attitudes. The re

Gli stili APA, Harvard, Vancouver, ISO e altri

45

Hölzl, Johannes Verfasser], Tobias [Akademischer Betreuer] [Nipkow, and Estaun Francisco Javier [Akademischer Betreuer] Esparza. "Construction and Stochastic Applications of Measure Spaces in Higher-Order Logic / Johannes Hölzl. Gutachter: Tobias Nipkow ; Francisco Javier Esparza Estaun. Betreuer: Tobias Nipkow." München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1033640344/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

46

Worth, Andrew Christopher. "English Coordination in Linear Categorial Grammar." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1451933040.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

47

Hague, Matthew. "Saturation methods for global model-checking pushdown systems." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.

Testo completo

Abstract (sommario):

Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Model-checking for pushdown systems has been well-studied. Tools implementing pushdown model-checking (e.g. Moped) are an essential back-end component of high-profile software model checkers such as SLAM, Blast and Terminator. Higher-order pushdown systems define a more complex memory structure: a higher-order stack is a stack of lower-order stacks. These systems form a robust h

Gli stili APA, Harvard, Vancouver, ISO e altri

48

Jacinto, Bruno. "Necessitism, contingentism and theory equivalence." Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/8814.

Testo completo

Abstract (sommario):

Two main questions are addressed in this dissertation, namely: 1. What is the correct higher-order modal theory; 2. What does it take for theories to be equivalent. The whole dissertation consists of an extended argument in defence of the joint truth of two higher-order modal theories, namely, Plantingan Moderate Contingentism, a higher-order necessitist theory advocated by Plantinga (1974) and committed to the contingent being of some individuals, and Williamsonian Thorough Necessitism, a higher-order necessitist theory advocated by Williamson (2013) and committed to the necessary being of ev

Gli stili APA, Harvard, Vancouver, ISO e altri

49

Maffre, Faustine. "Le bonheur est dans l'ignorance : logiques épistémiques dynamiques basées sur l'observabilité et leurs applications." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30112/document.

Testo completo

Abstract (sommario):

Dans les logiques épistémiques, la connaissance est généralement modélisée par un graphe de mondes possibles, qui correspondent aux alternatives à l'état actuel du monde. Ainsi, les arêtes entre les mondes représentent l'indistinguabilité. Connaître une proposition signifie que cette proposition est vraie dans toutes les alternatives possibles. Les informaticiens théoriques ont cependant remarqué que cela a conduit à plusieurs problèmes, à la fois intuitifs et techniques : plus un agent est ignorant, plus elle a d'alternatives à examiner ; les modèles peuvent alors devenir trop grands pour la

Gli stili APA, Harvard, Vancouver, ISO e altri

50

Lundberg, Didrik. "Provably Sound and Secure Automatic Proving and Generation of Verification Conditions." Thesis, KTH, Teoretisk datalogi, TCS, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239441.

Testo completo

Abstract (sommario):

Formal verification of programs can be done with the aid of an interactive theorem prover. The program to be verified is represented in an intermediate language representation inside the interactive theorem prover, after which statements and their proofs can be constructed. This is a process that can be automated to a high degree. This thesis presents a proof procedure to efficiently generate a theorem stating the weakest precondition for a program to terminate successfully in a state upon which a certain postcondition is placed. Specifically, the Poly/ML implementation of the SML metalanguage

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!