Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(modal logic). Showing records 61 – 90 of 114 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters

61. Lando, Tamar Ariela. Probabilistic Semantics for Modal Logic.

Degree: Philosophy, 2012, University of California – Berkeley

 We develop a probabilistic semantics for modal logic, which was introduced in recent years by Dana Scott. This semantics is intimately related to an older,… (more)

Subjects/Keywords: Philosophy; Logic; Mathematics; Completeness; Modal logic; Probabilistic semantics

…has now gone by since S. Kripke introduced Kripke semantics for modal logic. This semantics… …framework. But long before Kripke, there was Tarski. Looking at the axioms for the modal logic, S4… …converges, converges to a single point; and so on. What Tarski showed is that modal logic can be… …interpreted in topological spaces, and that—in a sense to be further specified below—the modal logic… …now called the topological semantics for modal logic. Their elegant completeness results… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lando, T. A. (2012). Probabilistic Semantics for Modal Logic. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/6df2g3xv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lando, Tamar Ariela. “Probabilistic Semantics for Modal Logic.” 2012. Thesis, University of California – Berkeley. Accessed August 25, 2019. http://www.escholarship.org/uc/item/6df2g3xv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lando, Tamar Ariela. “Probabilistic Semantics for Modal Logic.” 2012. Web. 25 Aug 2019.

Vancouver:

Lando TA. Probabilistic Semantics for Modal Logic. [Internet] [Thesis]. University of California – Berkeley; 2012. [cited 2019 Aug 25]. Available from: http://www.escholarship.org/uc/item/6df2g3xv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lando TA. Probabilistic Semantics for Modal Logic. [Thesis]. University of California – Berkeley; 2012. Available from: http://www.escholarship.org/uc/item/6df2g3xv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Canterbury

62. Krishnan, P. A Case Study in Specifying and Testing Architectural Features.

Degree: Computer Science and Software Engineering, 1993, University of Canterbury

This paper studies the specification and testing of two main architectural features. We consider restricted forms of instruction pipelining and parallel memory models present in the SPARC specification. The feasibility of using an automatic tool, the concurrency work bench, has been demonstrated.

Subjects/Keywords: architecture; SPARC; specification; verification; CCS; modal logic; concurrency work bench; Fields of Research::280000 Information, Computing and Communication Sciences::280100 Information Systems::280101 Information systems organisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krishnan, P. (1993). A Case Study in Specifying and Testing Architectural Features. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/3035

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Krishnan, P. “A Case Study in Specifying and Testing Architectural Features.” 1993. Thesis, University of Canterbury. Accessed August 25, 2019. http://hdl.handle.net/10092/3035.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Krishnan, P. “A Case Study in Specifying and Testing Architectural Features.” 1993. Web. 25 Aug 2019.

Vancouver:

Krishnan P. A Case Study in Specifying and Testing Architectural Features. [Internet] [Thesis]. University of Canterbury; 1993. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/10092/3035.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krishnan P. A Case Study in Specifying and Testing Architectural Features. [Thesis]. University of Canterbury; 1993. Available from: http://hdl.handle.net/10092/3035

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Canterbury

63. Campbell DI. Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred.

Degree: 2017, University of Canterbury

Subjects/Keywords: conceivability argument; modal argument; zombie argument; ontological argument; physicalism; Field of Research::22 - Philosophy and Religious Studies::2203 - Philosophy::220308 - Logic; Field of Research::22 - Philosophy and Religious Studies::2203 - Philosophy::220309 - Metaphysics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

DI, C. (2017). Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/15123

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

DI, Campbell. “Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred.” 2017. Thesis, University of Canterbury. Accessed August 25, 2019. http://hdl.handle.net/10092/15123.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

DI, Campbell. “Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred.” 2017. Web. 25 Aug 2019.

Vancouver:

DI C. Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred. [Internet] [Thesis]. University of Canterbury; 2017. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/10092/15123.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

DI C. Zombies, Schmonceivability and the Mirroring Objection: All Escape-Routes Barred. [Thesis]. University of Canterbury; 2017. Available from: http://hdl.handle.net/10092/15123

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Edinburgh

64. Gutierrez, Julian. On bisimulation and model-checking for concurrent systems with partial order semantics.

Degree: PhD, 2011, University of Edinburgh

 In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling… (more)

Subjects/Keywords: 004.01; mathematical logic; true concurrency; infinite games; fixpoint modal logics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gutierrez, J. (2011). On bisimulation and model-checking for concurrent systems with partial order semantics. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5281

Chicago Manual of Style (16th Edition):

Gutierrez, Julian. “On bisimulation and model-checking for concurrent systems with partial order semantics.” 2011. Doctoral Dissertation, University of Edinburgh. Accessed August 25, 2019. http://hdl.handle.net/1842/5281.

MLA Handbook (7th Edition):

Gutierrez, Julian. “On bisimulation and model-checking for concurrent systems with partial order semantics.” 2011. Web. 25 Aug 2019.

Vancouver:

Gutierrez J. On bisimulation and model-checking for concurrent systems with partial order semantics. [Internet] [Doctoral dissertation]. University of Edinburgh; 2011. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/1842/5281.

Council of Science Editors:

Gutierrez J. On bisimulation and model-checking for concurrent systems with partial order semantics. [Doctoral Dissertation]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/5281


University of Edinburgh

65. Jungteerapanich, Natthapong. Tableau systems for the modal μ-calculus.

Degree: PhD, 2010, University of Edinburgh

 The main content of this thesis concerns a tableau method for solving the satisfiability problem for the modal μ-calculus. A sound and complete tableau system… (more)

Subjects/Keywords: 518; tableaux; modal logic; logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jungteerapanich, N. (2010). Tableau systems for the modal μ-calculus. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4208

Chicago Manual of Style (16th Edition):

Jungteerapanich, Natthapong. “Tableau systems for the modal μ-calculus.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed August 25, 2019. http://hdl.handle.net/1842/4208.

MLA Handbook (7th Edition):

Jungteerapanich, Natthapong. “Tableau systems for the modal μ-calculus.” 2010. Web. 25 Aug 2019.

Vancouver:

Jungteerapanich N. Tableau systems for the modal μ-calculus. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/1842/4208.

Council of Science Editors:

Jungteerapanich N. Tableau systems for the modal μ-calculus. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/4208


University of Florida

66. Mayer, John Clyde, 1945-. Counterfactuals.

Degree: 1980, University of Florida

Subjects/Keywords: Contrafactuals; Inference; Logical antecedents; Logical consequents; Logical theorems; Modal logic; Modal realism; Semantics; Syntactical antecedents; Truth condition; Counterfactuals (Logic); Philosophy thesis Ph. D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mayer, John Clyde, 1. (1980). Counterfactuals. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00022259

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mayer, John Clyde, 1945-. “Counterfactuals.” 1980. Thesis, University of Florida. Accessed August 25, 2019. http://ufdc.ufl.edu/AA00022259.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mayer, John Clyde, 1945-. “Counterfactuals.” 1980. Web. 25 Aug 2019.

Vancouver:

Mayer, John Clyde 1. Counterfactuals. [Internet] [Thesis]. University of Florida; 1980. [cited 2019 Aug 25]. Available from: http://ufdc.ufl.edu/AA00022259.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mayer, John Clyde 1. Counterfactuals. [Thesis]. University of Florida; 1980. Available from: http://ufdc.ufl.edu/AA00022259

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

67. Smith, Jared. A Fitch-style derivation system for hybrid logic.

Degree: MA, Philosophy, 2014, University of Georgia

 Standard modal logic is typically parsed as concerning possible worlds. However there is no way for normal modal logic to refer to those possible worlds… (more)

Subjects/Keywords: Hybrid Logic; Modal Logic; Fitch-style Natural Deduction

…The subject matter of modal logic is the mode of statements. Typically that means a… …and possibility are the priority of the alethic logic branch of modal logic. Modal logic… …covers other, related, types of qualifiers. Doxastic logic is a branch of modal logic that… …logic. What connects these and all the modal logics together is that the truth of a modal… …sentential logic formula, but they are insufficient for modal statements. Consider what happens in… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Smith, J. (2014). A Fitch-style derivation system for hybrid logic. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/smith_jared_201405_ma

Chicago Manual of Style (16th Edition):

Smith, Jared. “A Fitch-style derivation system for hybrid logic.” 2014. Masters Thesis, University of Georgia. Accessed August 25, 2019. http://purl.galileo.usg.edu/uga_etd/smith_jared_201405_ma.

MLA Handbook (7th Edition):

Smith, Jared. “A Fitch-style derivation system for hybrid logic.” 2014. Web. 25 Aug 2019.

Vancouver:

Smith J. A Fitch-style derivation system for hybrid logic. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Aug 25]. Available from: http://purl.galileo.usg.edu/uga_etd/smith_jared_201405_ma.

Council of Science Editors:

Smith J. A Fitch-style derivation system for hybrid logic. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/smith_jared_201405_ma


University of Gothenburg / Göteborgs Universitet

68. Strannegård, Claes. Arithmetical realizations of modal formulas. Preliminary version.

Degree: 1996, University of Gothenburg / Göteborgs Universitet

 This thesis deals with provability logic. Strengthenings are obtained of some arithmetical completeness theorems by Berarducci, Carlson, Shavrukov, and Solovay. Conditions are provided for recursively… (more)

Subjects/Keywords: arithmetic; degrees of interpretability; diagonalizable algebra; interpretability logic; Magari algebra; metamathematics; modal logic; provability logic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Strannegård, C. (1996). Arithmetical realizations of modal formulas. Preliminary version. (Thesis). University of Gothenburg / Göteborgs Universitet. Retrieved from http://hdl.handle.net/2077/14320

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Strannegård, Claes. “Arithmetical realizations of modal formulas. Preliminary version.” 1996. Thesis, University of Gothenburg / Göteborgs Universitet. Accessed August 25, 2019. http://hdl.handle.net/2077/14320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Strannegård, Claes. “Arithmetical realizations of modal formulas. Preliminary version.” 1996. Web. 25 Aug 2019.

Vancouver:

Strannegård C. Arithmetical realizations of modal formulas. Preliminary version. [Internet] [Thesis]. University of Gothenburg / Göteborgs Universitet; 1996. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/2077/14320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Strannegård C. Arithmetical realizations of modal formulas. Preliminary version. [Thesis]. University of Gothenburg / Göteborgs Universitet; 1996. Available from: http://hdl.handle.net/2077/14320

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

69. Moon, Lori Ann. Modal auxiliary verbs and contexts.

Degree: PhD, Linguistics, 2016, University of Illinois – Urbana-Champaign

Modal auxiliary verbs, such as `could', `might', `must', `would', and others, have different readings depending on the context in which they occur (Kratzer 1981). The… (more)

Subjects/Keywords: formal semantics; formal grammar; pragmatics; syntax; modal auxiliary verbs; tense; aspect; epistemic modality; relativist semantics; relativism; assessment-sensitivity; categorial grammar; English; context; model theoretic semantics; intensional logic; natural language semantics

modal logic and possible worlds as a theoretical framework (Lewis 1973[54]… …order to focus on the modal logic component of meaning. The second type of approach seeks to… …modal logic analyses of the modal auxiliary verb, usually using standard notions of… …mentioned previously. The modal logic operator used to represent the denotation of a modal… …uses standard notions of modal logic in the interpretation of modal auxiliary verbs in that… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Moon, L. A. (2016). Modal auxiliary verbs and contexts. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95332

Chicago Manual of Style (16th Edition):

Moon, Lori Ann. “Modal auxiliary verbs and contexts.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 25, 2019. http://hdl.handle.net/2142/95332.

MLA Handbook (7th Edition):

Moon, Lori Ann. “Modal auxiliary verbs and contexts.” 2016. Web. 25 Aug 2019.

Vancouver:

Moon LA. Modal auxiliary verbs and contexts. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/2142/95332.

Council of Science Editors:

Moon LA. Modal auxiliary verbs and contexts. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95332


University of Illinois – Urbana-Champaign

70. Shirazi, Afsaneh H. Reasoning with models of probabilistic knowledge over probabilistic knowledge.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

 In multi-agent systems, the knowledge of agents about other agents??? knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves… (more)

Subjects/Keywords: Probabilistic Knowledge; Bayesian Networks; Modal Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shirazi, A. H. (2011). Reasoning with models of probabilistic knowledge over probabilistic knowledge. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24239

Chicago Manual of Style (16th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 25, 2019. http://hdl.handle.net/2142/24239.

MLA Handbook (7th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Web. 25 Aug 2019.

Vancouver:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/2142/24239.

Council of Science Editors:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24239


University of KwaZulu-Natal

71. Oladapo, Omoge Michael. Modal realism and acquaintance.

Degree: 2016, University of KwaZulu-Natal

 All propositions intelligible to us, whether or not they primarily concern things only known to us by description, are composed wholly of constituents with which… (more)

Subjects/Keywords: Realism.; Modality (Theory of Knowledge); Plurality of worlds.; Modality (Logic); Theses - Philosophy.; Modal Knowledge.; Acquaintance in knowledge.; Medal sceptcism .

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oladapo, O. M. (2016). Modal realism and acquaintance. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15283

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oladapo, Omoge Michael. “Modal realism and acquaintance.” 2016. Thesis, University of KwaZulu-Natal. Accessed August 25, 2019. http://hdl.handle.net/10413/15283.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oladapo, Omoge Michael. “Modal realism and acquaintance.” 2016. Web. 25 Aug 2019.

Vancouver:

Oladapo OM. Modal realism and acquaintance. [Internet] [Thesis]. University of KwaZulu-Natal; 2016. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/10413/15283.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oladapo OM. Modal realism and acquaintance. [Thesis]. University of KwaZulu-Natal; 2016. Available from: http://hdl.handle.net/10413/15283

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Lund

72. Rendsvig, Rasmus Kraemmer. Logical Dynamics and Dynamical Systems.

Degree: 2018, University of Lund

 This thesis is on information dynamics modeled using *dynamic epistemic logic* (DEL). It takes the simple perspective of identifying models with maps, which under a… (more)

Subjects/Keywords: Formal epistemology; Modal logic; Dynamic epistemic logic; Dynamical systems; General topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rendsvig, R. K. (2018). Logical Dynamics and Dynamical Systems. (Doctoral Dissertation). University of Lund. Retrieved from http://lup.lub.lu.se/record/08f57b4b-428c-4af9-b31b-2762e8fd7c00 ; http://portal.research.lu.se/ws/files/38754134/Rendsvig_2018_Logical_Dynamics_and_Dynamical_Systems.pdf

Chicago Manual of Style (16th Edition):

Rendsvig, Rasmus Kraemmer. “Logical Dynamics and Dynamical Systems.” 2018. Doctoral Dissertation, University of Lund. Accessed August 25, 2019. http://lup.lub.lu.se/record/08f57b4b-428c-4af9-b31b-2762e8fd7c00 ; http://portal.research.lu.se/ws/files/38754134/Rendsvig_2018_Logical_Dynamics_and_Dynamical_Systems.pdf.

MLA Handbook (7th Edition):

Rendsvig, Rasmus Kraemmer. “Logical Dynamics and Dynamical Systems.” 2018. Web. 25 Aug 2019.

Vancouver:

Rendsvig RK. Logical Dynamics and Dynamical Systems. [Internet] [Doctoral dissertation]. University of Lund; 2018. [cited 2019 Aug 25]. Available from: http://lup.lub.lu.se/record/08f57b4b-428c-4af9-b31b-2762e8fd7c00 ; http://portal.research.lu.se/ws/files/38754134/Rendsvig_2018_Logical_Dynamics_and_Dynamical_Systems.pdf.

Council of Science Editors:

Rendsvig RK. Logical Dynamics and Dynamical Systems. [Doctoral Dissertation]. University of Lund; 2018. Available from: http://lup.lub.lu.se/record/08f57b4b-428c-4af9-b31b-2762e8fd7c00 ; http://portal.research.lu.se/ws/files/38754134/Rendsvig_2018_Logical_Dynamics_and_Dynamical_Systems.pdf


University of Manchester

73. Reker, Hilverd Geert. Tableau-based reasoning for decidable fragments of first-order logic.

Degree: PhD, 2012, University of Manchester

 Automated deduction procedures for modal logics, and related decidable fragments of first-order logic, are used in many real-world applications. A popular way of obtaining decision… (more)

Subjects/Keywords: 511.3; decidable fragments; decision procedures; first-order logic; free-variable tableaux; modal logics; tableau calculi; two-variable fragment; unification; disconnection tableaux

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reker, H. G. (2012). Tableau-based reasoning for decidable fragments of first-order logic. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553436

Chicago Manual of Style (16th Edition):

Reker, Hilverd Geert. “Tableau-based reasoning for decidable fragments of first-order logic.” 2012. Doctoral Dissertation, University of Manchester. Accessed August 25, 2019. https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553436.

MLA Handbook (7th Edition):

Reker, Hilverd Geert. “Tableau-based reasoning for decidable fragments of first-order logic.” 2012. Web. 25 Aug 2019.

Vancouver:

Reker HG. Tableau-based reasoning for decidable fragments of first-order logic. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2019 Aug 25]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553436.

Council of Science Editors:

Reker HG. Tableau-based reasoning for decidable fragments of first-order logic. [Doctoral Dissertation]. University of Manchester; 2012. Available from: https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553436

74. Papacchini, Fabio. Minimal model reasoning for modal logic.

Degree: PhD, 2015, University of Manchester

 Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this… (more)

Subjects/Keywords: 006.3; Minimal Model Reasoning; Tableaux Methods; Modal Logic; Model Generation; Minimal Model Generation; Subset-simulation; Automated Reasoning

…for minimal model generation can be used to generate minimal models for modal logic formulae… …contribution of this work is a formal definition of a Herbrand semantics for modal logic. This new… …the generation of minimal modal Herbrand models are studied only for the modal logic K(… …same is not possible for role in description logic (relation in modal logic). This… …also for roles (that in the modal case reflects some class of dynamic modal logic)… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Papacchini, F. (2015). Minimal model reasoning for modal logic. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.634948

Chicago Manual of Style (16th Edition):

Papacchini, Fabio. “Minimal model reasoning for modal logic.” 2015. Doctoral Dissertation, University of Manchester. Accessed August 25, 2019. https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.634948.

MLA Handbook (7th Edition):

Papacchini, Fabio. “Minimal model reasoning for modal logic.” 2015. Web. 25 Aug 2019.

Vancouver:

Papacchini F. Minimal model reasoning for modal logic. [Internet] [Doctoral dissertation]. University of Manchester; 2015. [cited 2019 Aug 25]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.634948.

Council of Science Editors:

Papacchini F. Minimal model reasoning for modal logic. [Doctoral Dissertation]. University of Manchester; 2015. Available from: https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.634948

75. Papacchini, Fabio. Minimal Model Reasoning for Modal Logic.

Degree: 2015, University of Manchester

 Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this… (more)

Subjects/Keywords: Minimal Model Reasoning; Tableaux Methods; Modal Logic; Model Generation; Minimal Model Generation; Subset-simulation; Automated Reasoning

…Herbrand semantics for modal logic. This new semantics is used to design a minimality criterion… …modal logic K(m) and its extensions with reflexivity and transitivity. Another… …same is not possible for role in description logic (relation in modal logic). This… …also for roles (that in the modal case reflects some class of dynamic modal logic)… …decidability. Thanks to the close relation with modal logic, those decidability results for… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Papacchini, F. (2015). Minimal Model Reasoning for Modal Logic. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:247065

Chicago Manual of Style (16th Edition):

Papacchini, Fabio. “Minimal Model Reasoning for Modal Logic.” 2015. Doctoral Dissertation, University of Manchester. Accessed August 25, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:247065.

MLA Handbook (7th Edition):

Papacchini, Fabio. “Minimal Model Reasoning for Modal Logic.” 2015. Web. 25 Aug 2019.

Vancouver:

Papacchini F. Minimal Model Reasoning for Modal Logic. [Internet] [Doctoral dissertation]. University of Manchester; 2015. [cited 2019 Aug 25]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:247065.

Council of Science Editors:

Papacchini F. Minimal Model Reasoning for Modal Logic. [Doctoral Dissertation]. University of Manchester; 2015. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:247065

76. Reker, Hilverd Geert. Tableau-Based Reasoning for Decidable Fragments of First-Order Logic.

Degree: 2012, University of Manchester

 Automated deduction procedures for modal logics, and related decidable fragments of first-order logic, are used in many real-world applications. A popular way of obtaining decision… (more)

Subjects/Keywords: decidable fragments; decision procedures; first-order logic; free-variable tableaux; modal logics; tableau calculi; two-variable fragment; unification; disconnection tableaux

modal logics and related decidable fragments of first-order logic. We may refer to these as… …and naturally correspond to the semantics of the logic. Although most modal-like logics have… …first-order logic [Fit90, Section 7.4]. In tableau procedures for modal-like logics… …decision procedures for modal logics and related decidable fragments of first-order logic. We are… …the above criteria could work directly with modal or description logic formulas, or it could… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reker, H. G. (2012). Tableau-Based Reasoning for Decidable Fragments of First-Order Logic. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:157594

Chicago Manual of Style (16th Edition):

Reker, Hilverd Geert. “Tableau-Based Reasoning for Decidable Fragments of First-Order Logic.” 2012. Doctoral Dissertation, University of Manchester. Accessed August 25, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:157594.

MLA Handbook (7th Edition):

Reker, Hilverd Geert. “Tableau-Based Reasoning for Decidable Fragments of First-Order Logic.” 2012. Web. 25 Aug 2019.

Vancouver:

Reker HG. Tableau-Based Reasoning for Decidable Fragments of First-Order Logic. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2019 Aug 25]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:157594.

Council of Science Editors:

Reker HG. Tableau-Based Reasoning for Decidable Fragments of First-Order Logic. [Doctoral Dissertation]. University of Manchester; 2012. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:157594


University of Melbourne

77. Su, Che-Ping. Justification logics for conflicting Information.

Degree: 2015, University of Melbourne

 In this thesis, I will develop two types of justification logic systems. Both logics deal with inconsistent information. In the first half of this thesis,… (more)

Subjects/Keywords: logic; modal logic; justification logic; inconsistent information; conflicting information; paraconsistent logic; belief revision; formal argumentation theory; the Realization Theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Su, C. (2015). Justification logics for conflicting Information. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/58430

Chicago Manual of Style (16th Edition):

Su, Che-Ping. “Justification logics for conflicting Information.” 2015. Doctoral Dissertation, University of Melbourne. Accessed August 25, 2019. http://hdl.handle.net/11343/58430.

MLA Handbook (7th Edition):

Su, Che-Ping. “Justification logics for conflicting Information.” 2015. Web. 25 Aug 2019.

Vancouver:

Su C. Justification logics for conflicting Information. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/11343/58430.

Council of Science Editors:

Su C. Justification logics for conflicting Information. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/58430


University of New South Wales

78. Ditu, Gabriel Cristian. The programming language TransLucid.

Degree: Computer Science & Engineering, 2007, University of New South Wales

 This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid… (more)

Subjects/Keywords: TransLucid; Lucid (Computer program language); Intensional programming; Cartesian programming; Declarative programming; Programming language semantics; Programming language translation; Modal logic; Intensional logic; Modality (Logic)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ditu, G. C. (2007). The programming language TransLucid. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Ditu, Gabriel Cristian. “The programming language TransLucid.” 2007. Doctoral Dissertation, University of New South Wales. Accessed August 25, 2019. http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true.

MLA Handbook (7th Edition):

Ditu, Gabriel Cristian. “The programming language TransLucid.” 2007. Web. 25 Aug 2019.

Vancouver:

Ditu GC. The programming language TransLucid. [Internet] [Doctoral dissertation]. University of New South Wales; 2007. [cited 2019 Aug 25]. Available from: http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true.

Council of Science Editors:

Ditu GC. The programming language TransLucid. [Doctoral Dissertation]. University of New South Wales; 2007. Available from: http://handle.unsw.edu.au/1959.4/40701 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1482/SOURCE02?view=true


University of Oxford

79. Perez-Urbina, Hector M. Tractable query answering for description logics via query rewriting.

Degree: 2010, University of Oxford

 We consider the problem of answering conjunctive queries over description logic knowledge bases via query rewriting. Given a conjunctive query Q and a TBox T,… (more)

Subjects/Keywords: 004; Applications and algorithms : Computing : Modal logic : Theory and automated verification : Description Logics : Query Answering : Query Rewriting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Perez-Urbina, H. M. (2010). Tractable query answering for description logics via query rewriting. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.532003

Chicago Manual of Style (16th Edition):

Perez-Urbina, Hector M. “Tractable query answering for description logics via query rewriting.” 2010. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.532003.

MLA Handbook (7th Edition):

Perez-Urbina, Hector M. “Tractable query answering for description logics via query rewriting.” 2010. Web. 25 Aug 2019.

Vancouver:

Perez-Urbina HM. Tractable query answering for description logics via query rewriting. [Internet] [Doctoral dissertation]. University of Oxford; 2010. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.532003.

Council of Science Editors:

Perez-Urbina HM. Tractable query answering for description logics via query rewriting. [Doctoral Dissertation]. University of Oxford; 2010. Available from: http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.532003


University of Oxford

80. Dosen, Kosta. Logical constants : an essay in proof theory.

Degree: 1980, University of Oxford

 [Abridged abstract] The goal is to give structural proof-theoretical analyses of logical constants, and thereby provide a criterion for what a logical constant is. Another… (more)

Subjects/Keywords: 510; Mathematical logic and foundations : Logic : logical constants : analysis : substructural logics : modal logic : uniqueness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dosen, K. (1980). Logical constants : an essay in proof theory. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:bdf47c54-66b4-493b-9648-92c94c0f70a5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254815

Chicago Manual of Style (16th Edition):

Dosen, Kosta. “Logical constants : an essay in proof theory.” 1980. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:bdf47c54-66b4-493b-9648-92c94c0f70a5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254815.

MLA Handbook (7th Edition):

Dosen, Kosta. “Logical constants : an essay in proof theory.” 1980. Web. 25 Aug 2019.

Vancouver:

Dosen K. Logical constants : an essay in proof theory. [Internet] [Doctoral dissertation]. University of Oxford; 1980. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:bdf47c54-66b4-493b-9648-92c94c0f70a5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254815.

Council of Science Editors:

Dosen K. Logical constants : an essay in proof theory. [Doctoral Dissertation]. University of Oxford; 1980. Available from: http://ora.ox.ac.uk/objects/uuid:bdf47c54-66b4-493b-9648-92c94c0f70a5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254815


University of Oxford

81. Viriyasitavat, Wattana. A framework of trust in service workflows.

Degree: PhD, 2013, University of Oxford

 The everything as a service concept enables dynamic resource provisions to be seen and delivered as services. Their proliferation nowadays leads to the creation of… (more)

Subjects/Keywords: 658.5; Software engineering; Applications and algorithms; Computer security; Modal logic; Theory and automated verification; trust; logic; algorithm; compliance checking; services

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Viriyasitavat, W. (2013). A framework of trust in service workflows. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:a894bd9c-eaf2-4ebd-91c1-35012cd0a527 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581278

Chicago Manual of Style (16th Edition):

Viriyasitavat, Wattana. “A framework of trust in service workflows.” 2013. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:a894bd9c-eaf2-4ebd-91c1-35012cd0a527 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581278.

MLA Handbook (7th Edition):

Viriyasitavat, Wattana. “A framework of trust in service workflows.” 2013. Web. 25 Aug 2019.

Vancouver:

Viriyasitavat W. A framework of trust in service workflows. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:a894bd9c-eaf2-4ebd-91c1-35012cd0a527 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581278.

Council of Science Editors:

Viriyasitavat W. A framework of trust in service workflows. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:a894bd9c-eaf2-4ebd-91c1-35012cd0a527 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581278


University of Oxford

82. Ho, Hsi-Ming. Topics in monitoring and planning for embedded real-time systems.

Degree: PhD, 2015, University of Oxford

 The verification of real-time systems has gained much interest in the formal verification community during the past two decades. In this thesis, we investigate two… (more)

Subjects/Keywords: 006.2; Computer science (mathematics); Applications and algorithms; Modal logic; Theory and automated verification; real-time logics; expressiveness; monitoring; computational complexity; antichains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ho, H. (2015). Topics in monitoring and planning for embedded real-time systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655131

Chicago Manual of Style (16th Edition):

Ho, Hsi-Ming. “Topics in monitoring and planning for embedded real-time systems.” 2015. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655131.

MLA Handbook (7th Edition):

Ho, Hsi-Ming. “Topics in monitoring and planning for embedded real-time systems.” 2015. Web. 25 Aug 2019.

Vancouver:

Ho H. Topics in monitoring and planning for embedded real-time systems. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655131.

Council of Science Editors:

Ho H. Topics in monitoring and planning for embedded real-time systems. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655131


University of Oxford

83. Fritz, Peter. Intensional type theory for higher-order contingentism.

Degree: PhD, 2015, University of Oxford

 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… (more)

Subjects/Keywords: 110; Metaphysics; Logic; Contingentism; Modal Logic; Type Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fritz, P. (2015). Intensional type theory for higher-order contingentism. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664827

Chicago Manual of Style (16th Edition):

Fritz, Peter. “Intensional type theory for higher-order contingentism.” 2015. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664827.

MLA Handbook (7th Edition):

Fritz, Peter. “Intensional type theory for higher-order contingentism.” 2015. Web. 25 Aug 2019.

Vancouver:

Fritz P. Intensional type theory for higher-order contingentism. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664827.

Council of Science Editors:

Fritz P. Intensional type theory for higher-order contingentism. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664827


University of Oxford

84. Studd, James Peter. Absolute and relative generality.

Degree: PhD, 2013, University of Oxford

 This thesis is concerned with the debate between absolutists and relativists about generality. Absolutists about quantification contend that we can quantify over absolutely everything; relativists… (more)

Subjects/Keywords: 510.1; Philosophy; Logic; Absolute generality; quantification; indefinite extensibility; set theory; modal set theory; Russell's paradox; modality; metasemantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Studd, J. P. (2013). Absolute and relative generality. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:9bb22c54-e921-420f-acdc-aee0828bdea8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588465

Chicago Manual of Style (16th Edition):

Studd, James Peter. “Absolute and relative generality.” 2013. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:9bb22c54-e921-420f-acdc-aee0828bdea8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588465.

MLA Handbook (7th Edition):

Studd, James Peter. “Absolute and relative generality.” 2013. Web. 25 Aug 2019.

Vancouver:

Studd JP. Absolute and relative generality. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:9bb22c54-e921-420f-acdc-aee0828bdea8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588465.

Council of Science Editors:

Studd JP. Absolute and relative generality. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:9bb22c54-e921-420f-acdc-aee0828bdea8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588465


University of Oxford

85. Hague, Matthew. Saturation methods for global model-checking pushdown systems.

Degree: PhD, 2009, University of Oxford

 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,… (more)

Subjects/Keywords: 005.3; Computer science (mathematics); Applications and algorithms; Computing; Modal logic; Theory and automated verification; higher-order pushdown automata; pushdown automata; verification; temporal logic; model-checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hague, M. (2009). Saturation methods for global model-checking pushdown systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504366

Chicago Manual of Style (16th Edition):

Hague, Matthew. “Saturation methods for global model-checking pushdown systems.” 2009. Doctoral Dissertation, University of Oxford. Accessed August 25, 2019. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504366.

MLA Handbook (7th Edition):

Hague, Matthew. “Saturation methods for global model-checking pushdown systems.” 2009. Web. 25 Aug 2019.

Vancouver:

Hague M. Saturation methods for global model-checking pushdown systems. [Internet] [Doctoral dissertation]. University of Oxford; 2009. [cited 2019 Aug 25]. Available from: http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504366.

Council of Science Editors:

Hague M. Saturation methods for global model-checking pushdown systems. [Doctoral Dissertation]. University of Oxford; 2009. Available from: http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504366


University of Pennsylvania

86. Dinesh, Nikhil. Regulatory Conformance Checking: Logic and Logical Form.

Degree: 2010, University of Pennsylvania

 We consider the problem of checking whether an organization conforms to a body of regulation. Conformance is studied in a runtime verification setting. The regulation… (more)

Subjects/Keywords: modal logic; access control; conformance; deontic logic; logical form; scope; Logic and Foundations of Mathematics; Other Computer Engineering; Semantics and Pragmatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dinesh, N. (2010). Regulatory Conformance Checking: Logic and Logical Form. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/295

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dinesh, Nikhil. “Regulatory Conformance Checking: Logic and Logical Form.” 2010. Thesis, University of Pennsylvania. Accessed August 25, 2019. https://repository.upenn.edu/edissertations/295.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dinesh, Nikhil. “Regulatory Conformance Checking: Logic and Logical Form.” 2010. Web. 25 Aug 2019.

Vancouver:

Dinesh N. Regulatory Conformance Checking: Logic and Logical Form. [Internet] [Thesis]. University of Pennsylvania; 2010. [cited 2019 Aug 25]. Available from: https://repository.upenn.edu/edissertations/295.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dinesh N. Regulatory Conformance Checking: Logic and Logical Form. [Thesis]. University of Pennsylvania; 2010. Available from: https://repository.upenn.edu/edissertations/295

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Rochester

87. Papai, Tivadar (1984 - ). Exploiting constraints, sequential structure, and knowledge in Markov logic networks.

Degree: PhD, 2014, University of Rochester

 In this dissertation we propose extensions to Markov logic networks that can improve inference and learning by exploiting deterministic constraints, expert knowledge or se- quential/temporal… (more)

Subjects/Keywords: Constraint programming; Exponential families; Markov logic; Modal logic; Random fields; Sequential domains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Papai, T. (. -. ). (2014). Exploiting constraints, sequential structure, and knowledge in Markov logic networks. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/28364

Chicago Manual of Style (16th Edition):

Papai, Tivadar (1984 - ). “Exploiting constraints, sequential structure, and knowledge in Markov logic networks.” 2014. Doctoral Dissertation, University of Rochester. Accessed August 25, 2019. http://hdl.handle.net/1802/28364.

MLA Handbook (7th Edition):

Papai, Tivadar (1984 - ). “Exploiting constraints, sequential structure, and knowledge in Markov logic networks.” 2014. Web. 25 Aug 2019.

Vancouver:

Papai T(-). Exploiting constraints, sequential structure, and knowledge in Markov logic networks. [Internet] [Doctoral dissertation]. University of Rochester; 2014. [cited 2019 Aug 25]. Available from: http://hdl.handle.net/1802/28364.

Council of Science Editors:

Papai T(-). Exploiting constraints, sequential structure, and knowledge in Markov logic networks. [Doctoral Dissertation]. University of Rochester; 2014. Available from: http://hdl.handle.net/1802/28364

88. Coscarelli, Bruno Costa. Introdução à Lógica Modal.

Degree: Mestrado, Matemática, 2009, University of São Paulo

O presente trabalho tem como objetivo proporcionar aos estudantes que precisem da lógica modal como ferramenta um texto conciso mas suficientemente completo. Embora seja um… (more)

Subjects/Keywords: lógica modal; modal logic; modalidade; modality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Coscarelli, B. C. (2009). Introdução à Lógica Modal. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17062009-161423/ ;

Chicago Manual of Style (16th Edition):

Coscarelli, Bruno Costa. “Introdução à Lógica Modal.” 2009. Masters Thesis, University of São Paulo. Accessed August 25, 2019. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17062009-161423/ ;.

MLA Handbook (7th Edition):

Coscarelli, Bruno Costa. “Introdução à Lógica Modal.” 2009. Web. 25 Aug 2019.

Vancouver:

Coscarelli BC. Introdução à Lógica Modal. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Aug 25]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17062009-161423/ ;.

Council of Science Editors:

Coscarelli BC. Introdução à Lógica Modal. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/45/45131/tde-17062009-161423/ ;

89. Salvatore, Felipe de Souza. Topics in modal quantification theory.

Degree: Mestrado, Filosofia, 2015, University of São Paulo

The modal logic S5 gives us a simple technical tool to analyze some main notions from philosophy (e.g. metaphysical necessity and epistemological concepts such as… (more)

Subjects/Keywords: First-order modal logic; Interpolação; Interpolation; Justification logic; Logic; Lógica; Lógica da justificação; Lógica modal de primeira ordem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Salvatore, F. d. S. (2015). Topics in modal quantification theory. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;

Chicago Manual of Style (16th Edition):

Salvatore, Felipe de Souza. “Topics in modal quantification theory.” 2015. Masters Thesis, University of São Paulo. Accessed August 25, 2019. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;.

MLA Handbook (7th Edition):

Salvatore, Felipe de Souza. “Topics in modal quantification theory.” 2015. Web. 25 Aug 2019.

Vancouver:

Salvatore FdS. Topics in modal quantification theory. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2019 Aug 25]. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;.

Council of Science Editors:

Salvatore FdS. Topics in modal quantification theory. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-14122015-122734/ ;

90. Fajardo, Rogerio Augusto dos Santos. \"Combinações de lógicas modais não-normais\".

Degree: Mestrado, Matemática, 2004, University of São Paulo

Neste trabalho, estudamos algumas formas de combinar sistemas de Lógica Modal, analisando quando a combinação preserva propriedades como correção, completude e decidibilidade. Estendemos um estudo… (more)

Subjects/Keywords: completeness; completude; decidability; decidibilidade; logic; lógica; Lógica Modal; modal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fajardo, R. A. d. S. (2004). \"Combinações de lógicas modais não-normais\". (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45131/tde-13122007-203348/ ;

Chicago Manual of Style (16th Edition):

Fajardo, Rogerio Augusto dos Santos. “\"Combinações de lógicas modais não-normais\".” 2004. Masters Thesis, University of São Paulo. Accessed August 25, 2019. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-13122007-203348/ ;.

MLA Handbook (7th Edition):

Fajardo, Rogerio Augusto dos Santos. “\"Combinações de lógicas modais não-normais\".” 2004. Web. 25 Aug 2019.

Vancouver:

Fajardo RAdS. \"Combinações de lógicas modais não-normais\". [Internet] [Masters thesis]. University of São Paulo; 2004. [cited 2019 Aug 25]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45131/tde-13122007-203348/ ;.

Council of Science Editors:

Fajardo RAdS. \"Combinações de lógicas modais não-normais\". [Masters Thesis]. University of São Paulo; 2004. Available from: http://www.teses.usp.br/teses/disponiveis/45/45131/tde-13122007-203348/ ;

[1] [2] [3] [4]

.