Gotowa bibliografia na temat „Predicate calculus”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Predicate calculus”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Predicate calculus"
LANZET, RAN. "A THREE-VALUED QUANTIFIED ARGUMENT CALCULUS: DOMAIN-FREE MODEL-THEORY, COMPLETENESS, AND EMBEDDING OF FOL". Review of Symbolic Logic 10, nr 3 (8.05.2017): 549–82. http://dx.doi.org/10.1017/s1755020317000053.
Pełny tekst źródłaFriedman, Harvey M., i Andrej Ščedrov. "On the quantificational logic of intuitionistic set theory". Mathematical Proceedings of the Cambridge Philosophical Society 99, nr 1 (styczeń 1986): 5–10. http://dx.doi.org/10.1017/s0305004100063854.
Pełny tekst źródłaRuitenburg, Wim. "Basic Predicate Calculus". Notre Dame Journal of Formal Logic 39, nr 1 (styczeń 1998): 18–46. http://dx.doi.org/10.1305/ndjfl/1039293019.
Pełny tekst źródłaBEN-YAMI, HANOCH. "THE QUANTIFIED ARGUMENT CALCULUS". Review of Symbolic Logic 7, nr 1 (22.01.2014): 120–46. http://dx.doi.org/10.1017/s1755020313000373.
Pełny tekst źródłaLiusti, Siti Ainim. "ANALISIS KALIMAT BERDASARKAN POLA KALIMAT DASAR DAN KALKULUS PREDIKAT". Adabiyyāt: Jurnal Bahasa dan Sastra 15, nr 2 (25.12.2016): 157. http://dx.doi.org/10.14421/ajbs.2016.15203.
Pełny tekst źródłaAndjelkovic, Danica. "Aristotle's syllogistic and modern logic". Theoria, Beograd 48, nr 3-4 (2005): 155–66. http://dx.doi.org/10.2298/theo0504155a.
Pełny tekst źródłaShalack, Vladimir. "On Some Applied First-Order Theories which Can Be Represented by Definitions". Bulletin of the Section of Logic 44, nr 1/2 (1.01.2015): 19–24. http://dx.doi.org/10.18778/0138-0680.44.1.2.03.
Pełny tekst źródłaKonikowska, Beata, Andrzej Tarlecki i Andrzej Blikle. "A Three-Valued Logic for Software Specification and Validation. Tertium tamen datur". Fundamenta Informaticae 14, nr 4 (1.04.1991): 411–53. http://dx.doi.org/10.3233/fi-1991-14403.
Pełny tekst źródłaMonahan, Brian. "Predicate calculus and program semantics". Science of Computer Programming 17, nr 1-3 (grudzień 1991): 259–62. http://dx.doi.org/10.1016/0167-6423(91)90048-3.
Pełny tekst źródłaBörger, Egon. "Predicate calculus and program semantics". Science of Computer Programming 23, nr 1 (październik 1994): 91–101. http://dx.doi.org/10.1016/0167-6423(94)90002-7.
Pełny tekst źródłaRozprawy doktorskie na temat "Predicate calculus"
Joshi, Rejeev. "Immediacy : a technique for reasoning about asynchrony /". Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Pełny tekst źródłaFlorio, 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.
Pełny tekst źródłaHondet, Gabriel. "Expressing predicate subtyping in computational logical frameworks". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG070.
Pełny tekst źródłaSafe 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, i 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.
Pełny tekst źródłaLawley, Michael John. "Program Transformation for Proving Database Transaction Safety". Thesis, Griffith University, 2000. http://hdl.handle.net/10072/365511.
Pełny tekst źródłaThesis (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.
Pełny tekst źródłaApproved 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.
Pełny tekst źródłaDoctoral 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.
Pełny tekst źródłaCoordenaçã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.
Pełny tekst źródłaRaddaoui, Béchir. "Le calcul des predicats : application aux bases de donnees". Toulouse 3, 1987. http://www.theses.fr/1987TOU30046.
Pełny tekst źródłaKsiążki na temat "Predicate calculus"
Dijkstra, Edsger W., i Carel S. Scholten. Predicate Calculus and Program Semantics. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-3228-5.
Pełny tekst źródłaDijkstra, Edsger Wybe. Predicate calculus and program semantics. New York: Springer-Verlag, 1990.
Znajdź pełny tekst źródłaDijkstra, Edsger Wybe. Predicate calculus and program semantics. New York: Springer-Verlag, 1990.
Znajdź pełny tekst źródłaDijkstra, Edsger Wybe. Predicate Calculus and Program Semantics. New York, NY: Springer New York, 1990.
Znajdź pełny tekst źródłaSimpson, Stephen G. Subsystems of second order arithmetic. Berlin: Springer, 1999.
Znajdź pełny tekst źródłaSimpson, Stephen G. Subsystems of second-order arithmetic. Wyd. 2. Cambridge: Cambridge University Press, 2009.
Znajdź pełny tekst źródłaSimpson, Stephen G. Subsystems of second-order arithmetic. Wyd. 2. Cambridge: Cambridge University Press, 2009.
Znajdź pełny tekst źródłaSimpson, Stephen G. Subsystems of Second Order Arithmetic. Wyd. 2. Leiden: Cambridge University Press, 2009.
Znajdź pełny tekst źródłaBüning, H. Kleine. Aussagenlogik: Deduktion und Algorithmen. Stuttgart: B.G. Teubner, 1994.
Znajdź pełny tekst źródłaNaishtat, Francisco S. Lógica para computación. [Buenos Aires]: Editorial Universitaria de Buenos Aires, 1986.
Znajdź pełny tekst źródłaCzęści książek na temat "Predicate calculus"
Booth, Dexter J. "Predicate calculus". W Foundation Discrete Mathematics for Computing, 151–70. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4899-7114-2_5.
Pełny tekst źródłaBaxter, Nancy, Ed Dubinsky i Gary Levin. "Predicate Calculus". W Learning Discrete Mathematics with ISETL, 225–63. New York, NY: Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-3592-7_5.
Pełny tekst źródłaFenton, William E., i Ed Dubinsky. "Predicate Calculus". W Introduction to Discrete Mathematics with ISETL, 73–96. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-4052-5_4.
Pełny tekst źródłaGries, David, i Fred B. Schneider. "Predicate Calculus". W A Logical Approach to Discrete Math, 157–77. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-3837-7_10.
Pełny tekst źródłaPace, Gordon J. "Predicate Calculus". W Mathematics of Discrete Structures for Computer Science, 57–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29840-0_3.
Pełny tekst źródłaZeugmann, Thomas, Pascal Poupart, James Kennedy, Xin Jin, Jiawei Han, Lorenza Saitta, Michele Sebag i in. "Predicate Calculus". W Encyclopedia of Machine Learning, 781. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_654.
Pełny tekst źródłaPolkowski, Lech. "Predicate Calculus". W Rough Sets, 273–96. Heidelberg: Physica-Verlag HD, 2002. http://dx.doi.org/10.1007/978-3-7908-1776-8_9.
Pełny tekst źródłaBack, Ralph-Johan, i Joakim Wright. "Predicate Transformers". W Refinement Calculus, 187–202. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1674-2_11.
Pełny tekst źródłaBen-Ari, Mordechai. "Predicate Calculus: Resolution". W Mathematical Logic for Computer Science, 139–72. London: Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0335-6_7.
Pełny tekst źródłaAnglin, W. S., i J. Lambek. "Intuitionistic Predicate Calculus". W The Heritage of Thales, 281–83. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-0803-7_58.
Pełny tekst źródłaStreszczenia konferencji na temat "Predicate calculus"
Dell'aquila, Carlo, Francesco Di Tria, Ezio Lefons i Filippo Tangorra. "Dimensional fact model extension via predicate calculus". W 2009 24th International Symposium on Computer and Information Sciences (ISCIS). IEEE, 2009. http://dx.doi.org/10.1109/iscis.2009.5291846.
Pełny tekst źródłaGanesan, G., i B. N. V. Satish. "A Study on Rough-Fuzzy Predicate Calculus". W 2014 7th International Conference on u- and e- Service, Science and Technology (UNESST). IEEE, 2014. http://dx.doi.org/10.1109/unesst.2014.9.
Pełny tekst źródłaZellweger, H. Paul. "A Decision Tree Interface Based on Predicate Calculus". W 2017 21st International Conference on Information Visualisation (IV). IEEE, 2017. http://dx.doi.org/10.1109/iv.2017.68.
Pełny tekst źródłaConsoli, Robert H. "Predicate calculus for an architecture of multiple neural networks". W SPIE Proceedings, redaktorzy Steven K. Rogers, Eustace L. Dereniak, P. McGeehin, Donald B. Carlin, David B. Kay i Robert E. Sampson. SPIE, 1990. http://dx.doi.org/10.1117/12.21193.
Pełny tekst źródłaLeal, Antonio. "A predicate calculus based language for data verification and validation". W 9th Computing in Aerospace Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1993. http://dx.doi.org/10.2514/6.1993-4462.
Pełny tekst źródłaNikitchenko, Mykola, Oksana Shkilniak i Stepan Shkilniak. "Sequent Calculus for a Program-oriented Predicate Logic over Complex-Named Data". W 2020 10th International Conference on Advanced Computer Information Technologies (ACIT). IEEE, 2020. http://dx.doi.org/10.1109/acit49673.2020.9208809.
Pełny tekst źródłaKosovskaya, Tatiana, i Juan Zhou. "Algorithms for Checking Isomorphism of Two Elementary Conjunctiоns". W Computer Science and Information Technologies 2023. Institute for Informatics and Automation Problems, 2023. http://dx.doi.org/10.51408/csit2023_01.
Pełny tekst źródłaKosovskaya, Tatiana M. "Partial deduction in predicate calculus as a tool for artificial intelligence problem complexity decreasing". W 2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS). IEEE, 2015. http://dx.doi.org/10.1109/intelcis.2015.7397199.
Pełny tekst źródłaFinch, William W., i Allen C. Ward. "Quantified Relations: A Class of Predicate Logic Design Constraints Among Sets of Manufacturing, Operating, and Other Variations". W ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/dtm-1550.
Pełny tekst źródłaConsole, Marco, Paolo Guagliardo i Leonid Libkin. "Do We Need Many-valued Logics for Incomplete Information?" W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/851.
Pełny tekst źródła