Dissertations / Theses on the topic 'Predicate calculus'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 18 dissertations / theses for your research on the topic 'Predicate calculus.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Joshi, Rejeev. "Immediacy : a technique for reasoning about asynchrony /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Full textFlorio, Salvatore. "Completeness of the Predicate Calculus in the Basic Theory of Predication." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1281927327.
Full textHondet, Gabriel. "Expressing predicate subtyping in computational logical frameworks." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG070.
Full textSafe programming as well as most proof systems rely on typing. The more a type system is expressive, the more these types can be used to encode invariants which are therefore verified mechanically through type checking procedures. Dependent types extend simple types by allowing types to depend on values. For instance, it allows to define the types of lists of a certain length. Predicate subtyping is another extension of simple type theory in which types can be defined by predicates. A predicate subtype, usually noted {x: A | P(x)}, is inhabited by elements t of type A for which P(t) is true. This extension provides an extremely rich and intuitive type system, which is at the heart of the proof assistant PVS, at the cost of making type checking undecidable.This work is dedicated to the encoding of predicate subtyping in Dedukti: a logical framework with computation rules. We begin with the encoding of explicit predicate subtyping for which the terms in {x: A | P(x)} and terms of Aare syntactically different. We show that any derivable judgement of predicate subtyping can be encoded into a derivable judgement of the logical framework. Predicate subtyping, is often used implicitly: with no syntactic difference between terms of type A and terms of type {x: A | P(x) }. We enrich our logical framework with a term refiner which can add these syntactic markers. This refiner can be used to refine judgements typed with implicit predicate subtyping into explicited judgements.The proof assistant PVS uses extensively predicate subtyping. We show how its standard library can be exported to Dedukti. Because PVS only store proof traces rather than complete proof terms, we sketch in the penultimate section a procedure to generate complete proof terms from these proof traces.The last section provides the architecture of a repository dedicated to the exchange of formal proofs. The goal of such a repository is to categorise and store proofs encoded in Dedukti to promote interoperability
Lawley, Michael John, and n/a. "Program Transformation for Proving Database Transaction Safety." Griffith University. School of Computing and Information Technology, 2000. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070228.150125.
Full textLawley, Michael John. "Program Transformation for Proving Database Transaction Safety." Thesis, Griffith University, 2000. http://hdl.handle.net/10072/365511.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Computing and Information Technology
Faculty of Information and Communication Technology
Full Text
Peach, Glen. "Visualização gráfica dos fundamentos da lógica matemática por meio de diagramas de conjuntos." Universidade Federal de São Carlos, 2017. https://repositorio.ufscar.br/handle/ufscar/9278.
Full textApproved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-24T12:17:05Z (GMT) No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5)
Approved for entry into archive by Ronildo Prado (bco.producao.intelectual@gmail.com) on 2018-01-24T12:18:07Z (GMT) No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5)
Made available in DSpace on 2018-01-24T12:21:46Z (GMT). No. of bitstreams: 1 DissGP.pdf: 3104844 bytes, checksum: 2e20a531a8e46327359fb4eacc9adf50 (MD5) Previous issue date: 2017-05-05
Não recebi financiamento
The purpose of this work is to propose a method that allow to bring the fundamentals of mathematical logic to high school through the use of set theory, however making the whole approach of the subject through diagrams, making it possible to avoid, for the demonstrations and understanding necessary to the development of the subject, the rigors of writing used in mathematical logic, which, in a first contact, tend to discourage the interest of beginning students.
O objetivo deste trabalho é propor um método que permita levar os fundamentos da lógica matemática para o ensino médio por meio da utilização da teoria dos conjuntos, porém fazendo todo a aproximação do assunto utilizando diagramas, tornando possível evitar assim, para as demonstrações e o entendimento necessários ao desenvolvimento do assunto, os rigores da escrita utilizada na lógica matemática, que, em um primeiro contato, podem desestimular o interesse dos alunos iniciantes
Aleksandar, Kupusinac. "Analiza osobina dinamičkih postuslova u Horovim tripletima." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2010. http://dx.doi.org/10.2298/NS20101213KUPUSINAC.
Full textDoctoral thesis presents a new and more general method for analizing of structured and object-oriented program semantics, based on the first-order predicate logic. Doctoral thesis consideres next topics:1.) S-program calculus,2.) Definition and characteristics of dynamic postconditions in S-calculus,3.) Conceptual definitions of object, class and invariant,4.) Analyses of invariants in class (SP-analyses and DP-analyses).
Sanctos, Cassia Sampaio. "Considerações sobre a demonstração original do teorema da completude de Kurt Gödel." Pontifícia Universidade Católica de São Paulo, 2015. https://tede2.pucsp.br/handle/handle/11683.
Full textCoordenação de Aperfeiçoamento de Pessoal de Nível Superior
The thesis constitutes a critical review of Gödel´s doctoral dissertation which presents a proof for the completeness of first order logic. The introduction addresses the concepts of formalism, axiomatic method and completeness, thus the proof can be contextualized. The language for the restricted functional calculus is defined, with the corresponding syntax and semantics, and the original Gödel´s demonstration is updated. The appendix contains a translation of the referred dissertation, which is unprecedented in Portuguese
O trabalho constitui um comentário crítico da dissertação de doutorado de Gödel que apresenta uma prova de completude da lógica de primeira ordem. A introdução trata dos conceitos de formalismo, método axiomático e completude, para que seja possível contextualizar a prova. A linguagem para o cálculo funcional restrito é definida, com sua sintaxe e semântica, e a demonstração original de Gödel é atualizada. O apêndice contém a tradução da referida dissertação, que é inédita em língua portuguesa
Cialdea, Marta. "Une methode de deduction automatique en logique modale." Toulouse 3, 1986. http://www.theses.fr/1986TOU30179.
Full textRaddaoui, Béchir. "Le calcul des predicats : application aux bases de donnees." Toulouse 3, 1987. http://www.theses.fr/1987TOU30046.
Full textSmith, Michael Anthony. "Embedding an object calculus in the unifying theories of programming." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8b5be90d-59c1-42c0-a996-ecd8015097b3.
Full textHameurlain, Abdelkader. "L'inference dans les bases de donnees relationnelles." Toulouse 3, 1987. http://www.theses.fr/1987TOU30281.
Full textJaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees." Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Full textTerwait, Abdallah. "Le calcul des Rd (Relations de discours) : approche sémantico-pragmatique et cognitive de la causalité en rapport avec la temporalité." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUL176.
Full textThis thesis proposes to address the question of causality in a formal perspective inspired by the framework of SDRT (Segmented Discourse Representation Theory). In particular, she pays attention to paratactic expressions of the causal relationship. This approach seems interesting and fruitful to us by the formalistic approach that it implements, its object being particularly labile. The analysis in this work focuses on the linguistic expression of causal relationships. The approach adopted to carry out treatments is to a large extent semantico-pragmatic. Although the functioning of linguistically marked causality, especially by means of because, is particularly documented in the scientific landscape (Moeschler 2003, Rossari 2004, Knott 1996, etc.), untagged sequences (paratactic) seem to be little studied in the linguistic research. This is in a way the main motivation that drove the implementation of this monograph. This study could therefore be situated at the interface between theoretical linguistics and formal linguistics. The treatments that are carried out rely largely on the EXPLICADIS corpus (Explanation and Speech argumentation). The choice of this resource could be justified in this way: this corpus makes it possible to account for causal relations according to a semasiological approach of relying almost exclusively on the relation itself without taking into account its linguistic markers.Moreover, we will address, in this research, the question of the Causation. In this respect, the argumental treatment ("the speculative spectrum") of so-called causative verbs (cause, provoke, trigger, etc.) would allow us to note that the arguments of this particular type of predicate would admit a propositional interpretation. The initial hypothesis is that the causation, thus conceived, seems to represent an implicit or more simply underlying inter-propositional relation. Moreover, we will focus on the causality / agency dichotomy
Alaqeeli, Omar. "The metatheory of the monadic hybrid calculus." Thesis, 2016. http://hdl.handle.net/1828/7184.
Full textGraduate
0800
0984
Johnson, Donald Gordon. "An improved theorem prover by using the semantics of structure." 1985. http://hdl.handle.net/2097/27463.
Full textΜπαγουλή, Αικατερίνη. "Μετατροπή εκφράσεων κατηγορηματικής λογικής πρώτης τάξης σε φυσική γλώσσα." Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/2106.
Full textTo help teaching the course of Artificial Intelligence in Computer Engineering and Informatics Department of Patras University, a web-based intelligent tutoring system, called Artificial Intelligence Teaching System (AITS), was created. Among other things, AITS teaches Predicate Logic as a Knowledge Representation and Automated Reasoning language and is an adapting system, allowing students to choose themselves the teaching rate and level. One of the issues that AITS deals with is the conversion of natural language (NL) sentences into First-Order Logic (FOL) formulas. Given that this is a non-automated process, it is difficult to give some hints to the students-users during their effort to convert an “unknown” (to the system) NL sentence into a FOL formula. However, some kind of help could be provided, if the system could translate (after checking its syntax) the proposed by the student FOL formula into a NL sentence. The student then will be able to compare the initial NL sentence with the one that its FOL formula corresponds to. In this way, it is easier to see whether his/her proposed FOL formula is compatible with the given NL sentence and perhaps make some amendments, before submitting the final answer. FOLtoNL (First Order Logic to Natural Language) is a rule-based system that converts FOL formulas into NL in order to provide the functionality described above. It uses the expert systems approach alongside natural language processing aspects. FOLtoNL is implemented in Jess (an expert system shell written in Java) and has been evaluated via an appropriately created set of FOL expressions.
Juan, Hsu-Cheng, and 阮序承. "Abdominal fat distribution on computed tomography predicts ureteric calculus fragmentation by shock wave lithotripsy." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/94020370822954458566.
Full text高雄醫學大學
醫學研究所
100
Objectives To assess the effects of abdominal fat on shock wave lithotripsy (SWL). We used pre-SWL unenhanced computed tomography (CT) to evaluate the impact of abdominal fat distribution and calculus characteristics on the outcome of SWL. Methods One hundred and eighty-five patients with a solitary ureteric calculus treated with SWL were retrospectively reviewed. Each patient underwent unenhanced CT within 1 month before SWL treatment. Treatment outcomes were evaluated 1 month later. Unenhanced CT parameters, including calculus surface area, Hounsfield unit (HU) density, abdominal fat area and skin to calculus distance (SSD) were analyzed. Results One hundred and twenty-eight of the 185 patients were found to be calculus-free following treatment. HU density, total fat area, visceral fat area, and SSD were identified as significant variables on multivariate