Scribd Logo
Upload

Welcome to Scribd!

  • 30 views

    FGHFSGHDSGHD FG DH D GHD FGH SDFGH SDF GHSD FH SDF GHSDF Hs DFH SDF GSD Fghs DFG SDF Gdfs Gdaf

    Uploaded by

    geovani lozano
    The document contains a lengthy discussion with many nonsensical characters and repetitions. It appears to be discussing a logic simulator assignment involving: 1. A formal logical expression involving implications and negations of the propositions "p", "q", and "r". 2. Defining the simple propositions in natural language terms of participating in programs and getting good grades. 3. Writing out the full formal expression in natural language. 4. Generating a truth table manually and with a logic simulator to determine if the expression is a tautology.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    FGHFSGHDSGHD FG DH D GHD FGH SDFGH SDF GHSD FH SDF GHSDF Hs DFH SDF GSD Fghs DFG SDF Gdfs Gdaf

    Uploaded by

    geovani lozano
    30 views8 pages
    The document contains a lengthy discussion with many nonsensical characters and repetitions. It appears to be discussing a logic simulator assignment involving: 1. A formal logical expression involving implications and negations of the propositions "p", "q", and "r". 2. Defining the simple propositions in natural language terms of participating in programs and getting good grades. 3. Writing out the full formal expression in natural language. 4. Generating a truth table manually and with a logic simulator to determine if the expression is a tautology.

    Original Description:

    ghfh

    Original Title

    ksjdfhskjdfhs4

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains a lengthy discussion with many nonsensical characters and repetitions. It appears to be discussing a logic simulator assignment involving: 1. A formal logical expression involving implications and negations of the propositions "p", "q", and "r". 2. Defining the simple propositions in natural language terms of participating in programs and getting good grades. 3. Writing out the full formal expression in natural language. 4. Generating a truth table manually and with a logic simulator to determine if the expression is a tautology.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    30 views8 pages

    FGHFSGHDSGHD FG DH D GHD FGH SDFGH SDF GHSD FH SDF GHSDF Hs DFH SDF GSD Fghs DFG SDF Gdfs Gdaf

    Uploaded by

    geovani lozano
    The document contains a lengthy discussion with many nonsensical characters and repetitions. It appears to be discussing a logic simulator assignment involving: 1. A formal logical expression involving implications and negations of the propositions "p", "q", and "r". 2. Defining the simple propositions in natural language terms of participating in programs and getting good grades. 3. Writing out the full formal expression in natural language. 4. Generating a truth table manually and with a logic simulator to determine if the expression is a tautology.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 8

    D

    Fghfsghdsghd
    Fg
    Dh
    D
    Ghd
    Fgh
    Sdfgh
    Sdf
    Ghsd
    Fh
    Sdf
    Ghsdf
    Hs
    Dfh
    Sdf
    Gsd
    Fghs
    Dfg
    Sdf
    Gdfs
    Gdaf
    gfgfgfgfgfgfgfJdfkhskjdfjkghdkjfhsdkjfsdf
    Sdfnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    Sdf
    S
    Df
    Sdfsdfsdfsdklfjsdkfjksldjfklsdjfs
    Sdklfjskdfjskdjfksjdfklsdjflksjdflksjdflksjkdfjsldkfjskdf
    skldfjskldfjslkdjflksjdflksjdflksjdklfjsdkfjsdklfdfhskjfs{fs
    Df
    Sdf
    Sdfsjdklfjskdjfklsjdfksdfjs
    Dfksdfjksdjflksjdfklsjdfklsjdlkfjsdklfjskldjfklsdjf
    sdfjskdfjlksdjf
    Cccckkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
    kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkklkmklkkpoi
    opipoiouiyutyyuccccccccccccccccc,,,,,,,,,,,,,,,,,cccccccccccfksdjfoskdf
    uiowurioweurowksjdslmnsd,fnskdfnqqqqqqqqqqqqqqqqaaaaaaa
    aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
    aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
    aaaaaaaaaaaaaaaaaaaaaaaaaa333333333333333rjekhwjdkwhskjd
    hksjahxcjakshdkjahsdkjahsjkdskldfksdjfksldjflksdjfklsjdfklsdjfklsjdf
    klsdfjlksdjfklsdjfklsdjfklsjdfklsjdkfjskldfjslkdfjlksdjfklsdjfccccccsvfgf
    gfvvvvvvvvvvvvvvvvvvvs
    yuyuyrufggghhhhhhhhhhghhgfhhhhhhhhhhhhhhhh
    fgfgfgfgfgfgfgfffffffffffffffffffffff
    asdgasdggllllllllllllll
    Dgsgggggggggggghhhhhhhhhhhhhhhhhhhhrrrrrrrrrrrrrrrrrrrrrrrrrrr
    rrrrrrrrrrrrrrrrrrrrrr
    Dgdgd
    Sddg
    G
    Sdgg
    g dgd
    Gs
    Dg
    dgdgdgsdgsdgsdgsdgsdgsdgsdgsdgsdgS
    dg
    sdg
    s
    dg
    dgsdgsdgsdgsdgsdgDf
    Sd
    F
    Sdf
    S
    Df
    Sdf
    S
    Dfs

    zFSDFSDFSDdddddddxcvddddddddddddddddddd

    Fsdfsdfddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
    dddd

    sdf
    Sf

    Fsvasd{fvc,mSKLDCJKOasc klacxm XZ

    Dcksduciasufqiwd

    sckaucxizyc Fadf

    Jhgjghj.ghjghjgh

    JkhkuyuhjgsdCV XCV GVBDgvsf

    jkhuyuitgyujhbmnSDFGSDGFS

    kljjlkjkljADFAD

    jkjlkjklj

    kjiuyutryersdadxcbvbnmn

    kjoiyhjgbnmn

     Simulador Lógica UNAD:

    FADFA

    DFA

    Ejercicio 3: ProblemaDFs de aplicación


     Expresión formal o simbólica (dada en el planteamiento del
    ejercicio):
    [(𝑝⟶𝑞)∧(∼𝑝⟶𝑟)]⟶(∼r⟶p)
     Definición de las proposiciones simples: (se define cada
    proposición simple del argumento, siempre en afirmativo y con letras
    en minúscula).

    p: participo en los CIPAS

    q: participo en los B-learning

    r: obtengo buenas calificaciones

     Lenguaje natural de la expresión formal: (A partir de las


    proposiciones simples anteriores y el lenguaje simbólico dado en el
    ejercicio, se construye la expresión en lenguaje formal o natural)

    Si participo en los CIPAS entonces participo en los B-learning. Si no


    participo en los CIPAS entonces obtengo buenas calificaciones. Por lo
    tanto, si no obtengo buenas calificaciones entonces participo en los
    CIPAS

     Generar la tabla de verdad manualmente: recuerde que


    aparte de las columnas de las proposiciones simples, debe haber
    tantas columnas como operadores lógicos hay en el lenguaje
    simbólico (incluye negaciones y demás operadores lógicos, en el
    caso del ejemplo que estamos trabajando, hay 3 proposiciones
    simples, hay 2 negaciones y 5 operadores lógicos), por lo tanto, la
    tabla de verdad está compuesta por 3 columnas de proposiciones
    simples, 2 de negaciones y 5 columnas de operadores lógicos.

     Resultado de la tabla de verdad: TAUTOLOGÍA

     Generar la tabla de verdad con el simulador Lógica UNAD

    You might also like