Sökning: "First-order logic"
Visar resultat 1 - 5 av 13 uppsatser innehållade orden First-order logic.
1. Formal model of eligibility requirements for the Department of Computing Science
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : This paper aims to formally model the eligibility requirements for the Department of Computing Science at Umea University. As of now, the requirements are written in plain text resulting in students or lecturers having to evaluate these manually. Eligibility requirements can be built complex which makes it difficult to handle manually. LÄS MER
2. Abstract Logics and Lindström's Theorem
Kandidat-uppsats, Uppsala universitet/Algebra, logik och representationsteoriSammanfattning : A definition of abstract logic is presented. This is used to explore and compare some abstract logics, such as logics with generalised quantifiers and infinitary logics, and their properties. Special focus is given to the properties of completeness, compactness, and the Löwenheim-Skolem property. LÄS MER
3. Proof Editor for Natural Deduction
Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : In this thesis, we present Logan, a proof editor for constructing Fitch-style proofs in first-order logic. This proof editor is intended to be used by students who are taking a course in logic. LÄS MER
4. Mahan in a New Millennium
Master-uppsats, FörsvarshögskolanSammanfattning : In 1890, the American naval officer and scholar Alfred Thayer Mahan formulated as a theory that seapower brings prosperity. This thesis in War Science tests whether Mahan’s theory remains valid in the modern day. A multi-disciplinary approach is taken, wherein a financial event study method is employed for hypothesis testing. LÄS MER
5. Combining Inlining and Contracting for Human Efficient Deductive Verification
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : A function is functionally correct when it behaves according to a specification that describes its input-output behaviour. With deductive verification, it is possible to prove whether a function conforms to its specification or not. LÄS MER