Sökning: "generalized quantifiers"

Hittade 3 avhandlingar innehållade orden generalized quantifiers.

  1. 1. Lindström quantifiers and higher-order notions on finite structures

    Författare :Anders Andersson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Finite model theory; generalized quantifiers; higher-order quantifiers and operators; bijective Ehrenfeucht-Fraïssé games; quantifying over quantifiers; isomorphism quantifiers; MATEMATIK; MATHEMATICS; MATEMATIK; matematisk logik; Mathematical Logic;

    Sammanfattning : The expressive power of first-order logic is very limited on finite structures. One important way to obtain stronger logics is to add Lindström quantifiers, and another is to add higher-order quantification. We investigate two different ways of combing the two approaches. LÄS MER

  3. 2. Optimal Detectors for Transient Signal Families and Nonlinear Sensors : Derivations and Applications

    Författare :Daniel Asraf; Mats Gustafsson; Anders Grennberg; Uppsala universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; optimal detection; transient signals; noncoherent detection; unknown arrival time; ultrasonic nondestructive testing; nonlinear sensor; stochastic resonance; Signalbehandling; Signal processing; Signalbehandling; Signal Processing; signalbehandling;

    Sammanfattning : This thesis is concerned with detection of transient signal families and detectors in nonlinear static sensor systems. The detection problems are treated within the framework of likelihood ratio based binary hypothesis testing. LÄS MER

  4. 3. Logics of Knowledge and Cryptography : Completeness and Expressiveness

    Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

    Sammanfattning : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. LÄS MER